./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe015_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe015_power.oepc.i ./goblint.2024-05-21_14-57-05.files/protection/safe015_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 15:36:33,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 15:36:33,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 15:36:33,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 15:36:33,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 15:36:33,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 15:36:33,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 15:36:33,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 15:36:33,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 15:36:33,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 15:36:33,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 15:36:33,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 15:36:33,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 15:36:33,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 15:36:33,525 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 15:36:33,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 15:36:33,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 15:36:33,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 15:36:33,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 15:36:33,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 15:36:33,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 15:36:33,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 15:36:33,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 15:36:33,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 15:36:33,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 15:36:33,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 15:36:33,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 15:36:33,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 15:36:33,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 15:36:33,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 15:36:33,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 15:36:33,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 15:36:33,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:36:33,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 15:36:33,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 15:36:33,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 15:36:33,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 15:36:33,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 15:36:33,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 15:36:33,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 15:36:33,539 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 15:36:33,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 15:36:33,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 15:36:33,539 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 15:36:33,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 15:36:33,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 15:36:33,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 15:36:33,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 15:36:33,852 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 15:36:33,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i [2024-06-04 15:36:35,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 15:36:35,398 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 15:36:35,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.oepc.i [2024-06-04 15:36:35,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681be32c5/75243313f8d948708210dd2a5625e7e9/FLAGba6bbbb8c [2024-06-04 15:36:35,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681be32c5/75243313f8d948708210dd2a5625e7e9 [2024-06-04 15:36:35,431 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 15:36:35,431 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 15:36:35,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe015_power.oepc.yml/witness.yml [2024-06-04 15:36:35,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 15:36:35,641 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 15:36:35,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 15:36:35,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 15:36:35,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 15:36:35,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:36:35" (1/2) ... [2024-06-04 15:36:35,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284ad594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:35, skipping insertion in model container [2024-06-04 15:36:35,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 03:36:35" (1/2) ... [2024-06-04 15:36:35,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a4e3c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 03:36:35, skipping insertion in model container [2024-06-04 15:36:35,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:36:35" (2/2) ... [2024-06-04 15:36:35,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284ad594 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:35, skipping insertion in model container [2024-06-04 15:36:35,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:36:35" (2/2) ... [2024-06-04 15:36:35,653 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 15:36:35,808 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 15:36:35,809 INFO L97 edCorrectnessWitness]: Location invariant before [L877-L877] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_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_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-04 15:36:35,810 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_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_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-04 15:36:35,810 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 2) && x$w_buff0 <= 127) && ((x$w_buff0 == 0 || x$w_buff0 == 1) || x$w_buff0 == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_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_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 2) && x$w_buff1 <= 127) && ((x$w_buff1 == 0 || x$w_buff1 == 1) || x$w_buff1 == 2)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-04 15:36:35,810 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 15:36:35,810 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-04 15:36:35,865 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 15:36:36,261 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:36:36,271 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 15:36:36,448 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 15:36:36,506 INFO L206 MainTranslator]: Completed translation [2024-06-04 15:36:36,506 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36 WrapperNode [2024-06-04 15:36:36,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 15:36:36,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 15:36:36,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 15:36:36,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 15:36:36,515 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 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,558 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 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,624 INFO L138 Inliner]: procedures = 175, calls = 111, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 338 [2024-06-04 15:36:36,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 15:36:36,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 15:36:36,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 15:36:36,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 15:36:36,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,683 INFO L175 MemorySlicer]: Split 66 memory accesses to 2 slices as follows [2, 64]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-06-04 15:36:36,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 15:36:36,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 15:36:36,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 15:36:36,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 15:36:36,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (1/1) ... [2024-06-04 15:36:36,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 15:36:36,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 15:36:36,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 15:36:36,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 15:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-04 15:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-04 15:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-04 15:36:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-04 15:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 15:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 15:36:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 15:36:36,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 15:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 15:36:36,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 15:36:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 15:36:36,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 15:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 15:36:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-04 15:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 15:36:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 15:36:36,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 15:36:36,816 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 15:36:36,994 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 15:36:36,997 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 15:36:37,720 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 15:36:37,720 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 15:36:38,370 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 15:36:38,370 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 15:36:38,371 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:36:38 BoogieIcfgContainer [2024-06-04 15:36:38,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 15:36:38,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 15:36:38,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 15:36:38,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 15:36:38,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 03:36:35" (1/4) ... [2024-06-04 15:36:38,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3c1fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 03:36:38, skipping insertion in model container [2024-06-04 15:36:38,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 03:36:35" (2/4) ... [2024-06-04 15:36:38,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3c1fbf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:36:38, skipping insertion in model container [2024-06-04 15:36:38,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 03:36:36" (3/4) ... [2024-06-04 15:36:38,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3c1fbf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 03:36:38, skipping insertion in model container [2024-06-04 15:36:38,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 03:36:38" (4/4) ... [2024-06-04 15:36:38,385 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.oepc.i [2024-06-04 15:36:38,402 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 15:36:38,403 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 15:36:38,403 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 15:36:38,472 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 15:36:38,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow [2024-06-04 15:36:38,567 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2024-06-04 15:36:38,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:36:38,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 15:36:38,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow [2024-06-04 15:36:38,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow [2024-06-04 15:36:38,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 15:36:38,597 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;@450c8976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 15:36:38,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 15:36:38,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 15:36:38,611 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 15:36:38,611 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 15:36:38,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:38,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 15:36:38,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:38,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:38,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1037568440, now seen corresponding path program 1 times [2024-06-04 15:36:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:38,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383252745] [2024-06-04 15:36:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:41,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383252745] [2024-06-04 15:36:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383252745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 15:36:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334357819] [2024-06-04 15:36:41,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:41,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 15:36:41,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 15:36:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 15:36:41,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:41,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:41,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:41,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:41,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:41,641 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-04 15:36:41,641 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-04 15:36:41,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 1364 events. 871/1364 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6209 event pairs, 498 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 2769. Up to 1333 conditions per place. [2024-06-04 15:36:41,653 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 30 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-04 15:36:41,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow [2024-06-04 15:36:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 15:36:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 15:36:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2024-06-04 15:36:41,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-04 15:36:41,666 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 4 states and 78 transitions. [2024-06-04 15:36:41,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow [2024-06-04 15:36:41,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:36:41,671 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 119 flow [2024-06-04 15:36:41,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-04 15:36:41,675 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-06-04 15:36:41,675 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 119 flow [2024-06-04 15:36:41,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:41,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:41,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 15:36:41,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:41,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -670787353, now seen corresponding path program 1 times [2024-06-04 15:36:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018512753] [2024-06-04 15:36:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018512753] [2024-06-04 15:36:43,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018512753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:43,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:43,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:36:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794996946] [2024-06-04 15:36:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:36:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:36:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:36:43,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:43,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:43,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:43,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:43,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:44,331 INFO L124 PetriNetUnfolderBase]: 873/1366 cut-off events. [2024-06-04 15:36:44,332 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-06-04 15:36:44,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3052 conditions, 1366 events. 873/1366 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6355 event pairs, 316 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 3036. Up to 1301 conditions per place. [2024-06-04 15:36:44,341 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 35 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-04 15:36:44,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 267 flow [2024-06-04 15:36:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:36:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:36:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-04 15:36:44,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-04 15:36:44,344 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 119 flow. Second operand 5 states and 96 transitions. [2024-06-04 15:36:44,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 267 flow [2024-06-04 15:36:44,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-04 15:36:44,346 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 199 flow [2024-06-04 15:36:44,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2024-06-04 15:36:44,347 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2024-06-04 15:36:44,347 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 199 flow [2024-06-04 15:36:44,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:44,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:44,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:44,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 15:36:44,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:44,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash -670578103, now seen corresponding path program 2 times [2024-06-04 15:36:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000325963] [2024-06-04 15:36:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:44,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000325963] [2024-06-04 15:36:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000325963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:36:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663974357] [2024-06-04 15:36:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:45,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 15:36:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 15:36:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 15:36:46,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:46,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:46,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:46,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:46,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:46,615 INFO L124 PetriNetUnfolderBase]: 871/1364 cut-off events. [2024-06-04 15:36:46,616 INFO L125 PetriNetUnfolderBase]: For 535/539 co-relation queries the response was YES. [2024-06-04 15:36:46,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3326 conditions, 1364 events. 871/1364 cut-off events. For 535/539 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6174 event pairs, 351 based on Foata normal form. 4/1368 useless extension candidates. Maximal degree in co-relation 3306. Up to 1300 conditions per place. [2024-06-04 15:36:46,624 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2024-06-04 15:36:46,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 335 flow [2024-06-04 15:36:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:36:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:36:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-04 15:36:46,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-04 15:36:46,630 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 199 flow. Second operand 5 states and 101 transitions. [2024-06-04 15:36:46,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 335 flow [2024-06-04 15:36:46,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 327 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 15:36:46,637 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 220 flow [2024-06-04 15:36:46,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-04 15:36:46,638 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2024-06-04 15:36:46,638 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 220 flow [2024-06-04 15:36:46,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:46,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:46,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:46,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 15:36:46,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:46,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:46,640 INFO L85 PathProgramCache]: Analyzing trace with hash 679379807, now seen corresponding path program 1 times [2024-06-04 15:36:46,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:46,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628687007] [2024-06-04 15:36:46,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:46,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628687007] [2024-06-04 15:36:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628687007] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:36:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070566564] [2024-06-04 15:36:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:48,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:36:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:36:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:36:48,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:48,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:48,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:48,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:48,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:49,304 INFO L124 PetriNetUnfolderBase]: 917/1435 cut-off events. [2024-06-04 15:36:49,304 INFO L125 PetriNetUnfolderBase]: For 460/464 co-relation queries the response was YES. [2024-06-04 15:36:49,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 1435 events. 917/1435 cut-off events. For 460/464 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6628 event pairs, 499 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 3399. Up to 1406 conditions per place. [2024-06-04 15:36:49,313 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 37 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-04 15:36:49,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 345 flow [2024-06-04 15:36:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:36:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:36:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-06-04 15:36:49,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4238095238095238 [2024-06-04 15:36:49,316 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 220 flow. Second operand 5 states and 89 transitions. [2024-06-04 15:36:49,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 345 flow [2024-06-04 15:36:49,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:36:49,320 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 240 flow [2024-06-04 15:36:49,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-04 15:36:49,322 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-06-04 15:36:49,322 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 240 flow [2024-06-04 15:36:49,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:49,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:49,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:49,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 15:36:49,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:49,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 49583520, now seen corresponding path program 1 times [2024-06-04 15:36:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913198244] [2024-06-04 15:36:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913198244] [2024-06-04 15:36:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913198244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460033738] [2024-06-04 15:36:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:51,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:51,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:51,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:51,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:51,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:51,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:52,330 INFO L124 PetriNetUnfolderBase]: 921/1443 cut-off events. [2024-06-04 15:36:52,330 INFO L125 PetriNetUnfolderBase]: For 473/479 co-relation queries the response was YES. [2024-06-04 15:36:52,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 1443 events. 921/1443 cut-off events. For 473/479 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6658 event pairs, 383 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3471. Up to 1373 conditions per place. [2024-06-04 15:36:52,340 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 41 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-04 15:36:52,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 408 flow [2024-06-04 15:36:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:36:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:36:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-04 15:36:52,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-04 15:36:52,346 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 240 flow. Second operand 6 states and 113 transitions. [2024-06-04 15:36:52,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 408 flow [2024-06-04 15:36:52,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:36:52,355 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 305 flow [2024-06-04 15:36:52,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2024-06-04 15:36:52,358 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-04 15:36:52,358 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 305 flow [2024-06-04 15:36:52,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:52,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:52,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 15:36:52,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:52,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash 49017150, now seen corresponding path program 2 times [2024-06-04 15:36:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575082585] [2024-06-04 15:36:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575082585] [2024-06-04 15:36:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575082585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592778385] [2024-06-04 15:36:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:54,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:54,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:54,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:54,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:54,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:54,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:54,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:55,156 INFO L124 PetriNetUnfolderBase]: 917/1437 cut-off events. [2024-06-04 15:36:55,156 INFO L125 PetriNetUnfolderBase]: For 725/731 co-relation queries the response was YES. [2024-06-04 15:36:55,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 1437 events. 917/1437 cut-off events. For 725/731 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6673 event pairs, 346 based on Foata normal form. 2/1410 useless extension candidates. Maximal degree in co-relation 3594. Up to 1370 conditions per place. [2024-06-04 15:36:55,166 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 37 selfloop transitions, 20 changer transitions 0/64 dead transitions. [2024-06-04 15:36:55,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 459 flow [2024-06-04 15:36:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:36:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:36:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:36:55,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-04 15:36:55,168 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 305 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:36:55,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 459 flow [2024-06-04 15:36:55,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 433 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:36:55,173 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 351 flow [2024-06-04 15:36:55,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-06-04 15:36:55,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-06-04 15:36:55,176 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 351 flow [2024-06-04 15:36:55,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:55,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:55,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:55,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 15:36:55,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:55,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash 49024094, now seen corresponding path program 1 times [2024-06-04 15:36:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50938543] [2024-06-04 15:36:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:57,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50938543] [2024-06-04 15:36:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50938543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619948662] [2024-06-04 15:36:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:57,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:57,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:57,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:57,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:57,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:57,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:57,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:57,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:36:57,935 INFO L124 PetriNetUnfolderBase]: 919/1440 cut-off events. [2024-06-04 15:36:57,935 INFO L125 PetriNetUnfolderBase]: For 833/839 co-relation queries the response was YES. [2024-06-04 15:36:57,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3697 conditions, 1440 events. 919/1440 cut-off events. For 833/839 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6647 event pairs, 472 based on Foata normal form. 2/1415 useless extension candidates. Maximal degree in co-relation 3668. Up to 1408 conditions per place. [2024-06-04 15:36:57,945 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 44 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-04 15:36:57,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 64 transitions, 489 flow [2024-06-04 15:36:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:36:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:36:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 15:36:57,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 15:36:57,947 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 351 flow. Second operand 6 states and 102 transitions. [2024-06-04 15:36:57,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 64 transitions, 489 flow [2024-06-04 15:36:57,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 462 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 15:36:57,952 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 376 flow [2024-06-04 15:36:57,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-06-04 15:36:57,952 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2024-06-04 15:36:57,953 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 376 flow [2024-06-04 15:36:57,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:57,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:36:57,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:36:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 15:36:57,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:36:57,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:36:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 49798784, now seen corresponding path program 2 times [2024-06-04 15:36:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:36:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689391129] [2024-06-04 15:36:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:36:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:36:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:36:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:36:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:36:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689391129] [2024-06-04 15:36:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689391129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:36:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:36:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:36:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948847343] [2024-06-04 15:36:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:36:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:36:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:36:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:36:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:36:59,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:36:59,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:36:59,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:36:59,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:36:59,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:00,759 INFO L124 PetriNetUnfolderBase]: 917/1437 cut-off events. [2024-06-04 15:37:00,759 INFO L125 PetriNetUnfolderBase]: For 1194/1198 co-relation queries the response was YES. [2024-06-04 15:37:00,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3893 conditions, 1437 events. 917/1437 cut-off events. For 1194/1198 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6545 event pairs, 462 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 3862. Up to 1396 conditions per place. [2024-06-04 15:37:00,767 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2024-06-04 15:37:00,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 564 flow [2024-06-04 15:37:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:37:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:37:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-04 15:37:00,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2024-06-04 15:37:00,770 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 376 flow. Second operand 6 states and 107 transitions. [2024-06-04 15:37:00,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 564 flow [2024-06-04 15:37:00,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 534 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-04 15:37:00,774 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 445 flow [2024-06-04 15:37:00,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-06-04 15:37:00,776 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2024-06-04 15:37:00,776 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 445 flow [2024-06-04 15:37:00,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:00,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:00,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:00,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 15:37:00,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:00,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:00,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1529056731, now seen corresponding path program 1 times [2024-06-04 15:37:00,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:00,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819728801] [2024-06-04 15:37:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:00,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819728801] [2024-06-04 15:37:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819728801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:03,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879076039] [2024-06-04 15:37:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:03,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:03,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 445 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:03,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:03,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:04,148 INFO L124 PetriNetUnfolderBase]: 892/1411 cut-off events. [2024-06-04 15:37:04,149 INFO L125 PetriNetUnfolderBase]: For 2127/2277 co-relation queries the response was YES. [2024-06-04 15:37:04,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 1411 events. 892/1411 cut-off events. For 2127/2277 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6557 event pairs, 316 based on Foata normal form. 6/1410 useless extension candidates. Maximal degree in co-relation 4018. Up to 1335 conditions per place. [2024-06-04 15:37:04,160 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 48 selfloop transitions, 22 changer transitions 0/77 dead transitions. [2024-06-04 15:37:04,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 615 flow [2024-06-04 15:37:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 15:37:04,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2024-06-04 15:37:04,162 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 445 flow. Second operand 7 states and 118 transitions. [2024-06-04 15:37:04,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 615 flow [2024-06-04 15:37:04,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 575 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:04,166 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 474 flow [2024-06-04 15:37:04,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=474, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-06-04 15:37:04,167 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-06-04 15:37:04,167 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 474 flow [2024-06-04 15:37:04,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:04,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:04,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:04,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 15:37:04,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:04,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1519748805, now seen corresponding path program 1 times [2024-06-04 15:37:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24936642] [2024-06-04 15:37:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24936642] [2024-06-04 15:37:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24936642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 15:37:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530902013] [2024-06-04 15:37:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 15:37:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 15:37:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 15:37:04,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2024-06-04 15:37:04,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-06-04 15:37:04,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:04,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2024-06-04 15:37:04,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:04,504 INFO L124 PetriNetUnfolderBase]: 413/842 cut-off events. [2024-06-04 15:37:04,504 INFO L125 PetriNetUnfolderBase]: For 1212/1281 co-relation queries the response was YES. [2024-06-04 15:37:04,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 842 events. 413/842 cut-off events. For 1212/1281 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4846 event pairs, 193 based on Foata normal form. 53/869 useless extension candidates. Maximal degree in co-relation 2182. Up to 486 conditions per place. [2024-06-04 15:37:04,511 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 42 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-04 15:37:04,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 607 flow [2024-06-04 15:37:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 15:37:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 15:37:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-04 15:37:04,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-06-04 15:37:04,512 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 474 flow. Second operand 3 states and 79 transitions. [2024-06-04 15:37:04,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 607 flow [2024-06-04 15:37:04,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 563 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 15:37:04,516 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 469 flow [2024-06-04 15:37:04,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-06-04 15:37:04,517 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2024-06-04 15:37:04,517 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 469 flow [2024-06-04 15:37:04,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-06-04 15:37:04,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:04,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:04,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 15:37:04,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:04,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1519073850, now seen corresponding path program 1 times [2024-06-04 15:37:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532117500] [2024-06-04 15:37:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532117500] [2024-06-04 15:37:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532117500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 15:37:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069246603] [2024-06-04 15:37:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 15:37:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 15:37:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 15:37:06,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:06,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:06,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:06,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:06,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:07,137 INFO L124 PetriNetUnfolderBase]: 1459/2249 cut-off events. [2024-06-04 15:37:07,137 INFO L125 PetriNetUnfolderBase]: For 3616/3748 co-relation queries the response was YES. [2024-06-04 15:37:07,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6771 conditions, 2249 events. 1459/2249 cut-off events. For 3616/3748 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11375 event pairs, 1048 based on Foata normal form. 1/2247 useless extension candidates. Maximal degree in co-relation 6737. Up to 2211 conditions per place. [2024-06-04 15:37:07,163 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 59 selfloop transitions, 12 changer transitions 0/78 dead transitions. [2024-06-04 15:37:07,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 78 transitions, 654 flow [2024-06-04 15:37:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 15:37:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 15:37:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-04 15:37:07,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 15:37:07,166 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 469 flow. Second operand 5 states and 90 transitions. [2024-06-04 15:37:07,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 78 transitions, 654 flow [2024-06-04 15:37:07,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 78 transitions, 637 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-04 15:37:07,175 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 527 flow [2024-06-04 15:37:07,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2024-06-04 15:37:07,176 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2024-06-04 15:37:07,176 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 76 transitions, 527 flow [2024-06-04 15:37:07,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:07,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:07,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:07,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 15:37:07,177 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:07,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1297210701, now seen corresponding path program 2 times [2024-06-04 15:37:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125317523] [2024-06-04 15:37:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:09,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125317523] [2024-06-04 15:37:09,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125317523] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:09,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:09,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845640801] [2024-06-04 15:37:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:09,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:09,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:09,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:09,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 76 transitions, 527 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:09,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:09,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:09,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:10,552 INFO L124 PetriNetUnfolderBase]: 947/1529 cut-off events. [2024-06-04 15:37:10,552 INFO L125 PetriNetUnfolderBase]: For 2549/2679 co-relation queries the response was YES. [2024-06-04 15:37:10,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4865 conditions, 1529 events. 947/1529 cut-off events. For 2549/2679 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7450 event pairs, 344 based on Foata normal form. 2/1528 useless extension candidates. Maximal degree in co-relation 4827. Up to 1445 conditions per place. [2024-06-04 15:37:10,567 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 62 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2024-06-04 15:37:10,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 847 flow [2024-06-04 15:37:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 15:37:10,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-04 15:37:10,570 INFO L175 Difference]: Start difference. First operand has 81 places, 76 transitions, 527 flow. Second operand 7 states and 131 transitions. [2024-06-04 15:37:10,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 847 flow [2024-06-04 15:37:10,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 15:37:10,580 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 689 flow [2024-06-04 15:37:10,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=689, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2024-06-04 15:37:10,581 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2024-06-04 15:37:10,581 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 689 flow [2024-06-04 15:37:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:10,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:10,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:10,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 15:37:10,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:10,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1555815801, now seen corresponding path program 3 times [2024-06-04 15:37:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716892373] [2024-06-04 15:37:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:12,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716892373] [2024-06-04 15:37:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716892373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:12,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:12,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917081039] [2024-06-04 15:37:12,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:12,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:12,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:12,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:12,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:12,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:12,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 689 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:12,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:12,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:12,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:13,510 INFO L124 PetriNetUnfolderBase]: 948/1531 cut-off events. [2024-06-04 15:37:13,510 INFO L125 PetriNetUnfolderBase]: For 3052/3182 co-relation queries the response was YES. [2024-06-04 15:37:13,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5028 conditions, 1531 events. 948/1531 cut-off events. For 3052/3182 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7469 event pairs, 347 based on Foata normal form. 2/1530 useless extension candidates. Maximal degree in co-relation 4986. Up to 1448 conditions per place. [2024-06-04 15:37:13,520 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 56 selfloop transitions, 31 changer transitions 0/94 dead transitions. [2024-06-04 15:37:13,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 914 flow [2024-06-04 15:37:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-04 15:37:13,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2024-06-04 15:37:13,522 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 689 flow. Second operand 7 states and 125 transitions. [2024-06-04 15:37:13,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 914 flow [2024-06-04 15:37:13,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 872 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-04 15:37:13,528 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 752 flow [2024-06-04 15:37:13,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=752, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-06-04 15:37:13,529 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2024-06-04 15:37:13,529 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 752 flow [2024-06-04 15:37:13,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:13,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:13,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:13,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 15:37:13,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:13,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1297199541, now seen corresponding path program 4 times [2024-06-04 15:37:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:13,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458247591] [2024-06-04 15:37:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458247591] [2024-06-04 15:37:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458247591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:15,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:15,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060377297] [2024-06-04 15:37:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:15,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:15,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:15,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:15,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:15,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 752 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:15,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:15,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:15,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:16,608 INFO L124 PetriNetUnfolderBase]: 946/1531 cut-off events. [2024-06-04 15:37:16,608 INFO L125 PetriNetUnfolderBase]: For 3052/3191 co-relation queries the response was YES. [2024-06-04 15:37:16,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 1531 events. 946/1531 cut-off events. For 3052/3191 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7470 event pairs, 265 based on Foata normal form. 2/1530 useless extension candidates. Maximal degree in co-relation 4931. Up to 1408 conditions per place. [2024-06-04 15:37:16,615 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 68 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2024-06-04 15:37:16,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 106 transitions, 1033 flow [2024-06-04 15:37:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-04 15:37:16,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2024-06-04 15:37:16,617 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 752 flow. Second operand 7 states and 135 transitions. [2024-06-04 15:37:16,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 106 transitions, 1033 flow [2024-06-04 15:37:16,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 106 transitions, 947 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 15:37:16,623 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 742 flow [2024-06-04 15:37:16,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=742, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-06-04 15:37:16,623 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2024-06-04 15:37:16,623 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 742 flow [2024-06-04 15:37:16,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:16,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:16,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:16,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 15:37:16,624 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:16,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1382945161, now seen corresponding path program 1 times [2024-06-04 15:37:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840441948] [2024-06-04 15:37:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840441948] [2024-06-04 15:37:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840441948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:37:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383155614] [2024-06-04 15:37:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:18,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:37:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:37:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:37:18,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:18,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 742 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:18,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:18,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:18,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:19,372 INFO L124 PetriNetUnfolderBase]: 995/1616 cut-off events. [2024-06-04 15:37:19,372 INFO L125 PetriNetUnfolderBase]: For 3170/3172 co-relation queries the response was YES. [2024-06-04 15:37:19,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 1616 events. 995/1616 cut-off events. For 3170/3172 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8008 event pairs, 340 based on Foata normal form. 0/1593 useless extension candidates. Maximal degree in co-relation 5374. Up to 1525 conditions per place. [2024-06-04 15:37:19,381 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 79 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-04 15:37:19,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 1091 flow [2024-06-04 15:37:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-04 15:37:19,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421768707482993 [2024-06-04 15:37:19,389 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 742 flow. Second operand 7 states and 130 transitions. [2024-06-04 15:37:19,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 1091 flow [2024-06-04 15:37:19,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 1005 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 15:37:19,407 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 795 flow [2024-06-04 15:37:19,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=795, PETRI_PLACES=94, PETRI_TRANSITIONS=97} [2024-06-04 15:37:19,408 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2024-06-04 15:37:19,408 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 795 flow [2024-06-04 15:37:19,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:19,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:19,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:19,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 15:37:19,409 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:19,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1267028783, now seen corresponding path program 2 times [2024-06-04 15:37:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015320546] [2024-06-04 15:37:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015320546] [2024-06-04 15:37:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015320546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:37:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647584160] [2024-06-04 15:37:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:21,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:37:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:21,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:37:21,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:37:21,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:21,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 795 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:21,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:21,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:21,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:22,096 INFO L124 PetriNetUnfolderBase]: 996/1618 cut-off events. [2024-06-04 15:37:22,096 INFO L125 PetriNetUnfolderBase]: For 3885/3887 co-relation queries the response was YES. [2024-06-04 15:37:22,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5695 conditions, 1618 events. 996/1618 cut-off events. For 3885/3887 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8037 event pairs, 345 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 5653. Up to 1551 conditions per place. [2024-06-04 15:37:22,104 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 23 changer transitions 0/108 dead transitions. [2024-06-04 15:37:22,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 108 transitions, 1068 flow [2024-06-04 15:37:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-04 15:37:22,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41496598639455784 [2024-06-04 15:37:22,106 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 795 flow. Second operand 7 states and 122 transitions. [2024-06-04 15:37:22,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 108 transitions, 1068 flow [2024-06-04 15:37:22,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 108 transitions, 1010 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:22,115 INFO L231 Difference]: Finished difference. Result has 100 places, 102 transitions, 856 flow [2024-06-04 15:37:22,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=856, PETRI_PLACES=100, PETRI_TRANSITIONS=102} [2024-06-04 15:37:22,116 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-06-04 15:37:22,116 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 102 transitions, 856 flow [2024-06-04 15:37:22,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:22,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:22,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:22,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 15:37:22,117 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:22,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash -139100547, now seen corresponding path program 3 times [2024-06-04 15:37:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522685278] [2024-06-04 15:37:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522685278] [2024-06-04 15:37:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522685278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:37:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873175967] [2024-06-04 15:37:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:23,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:37:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:37:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:37:24,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:24,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:24,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:24,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:24,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:24,758 INFO L124 PetriNetUnfolderBase]: 995/1615 cut-off events. [2024-06-04 15:37:24,759 INFO L125 PetriNetUnfolderBase]: For 4090/4092 co-relation queries the response was YES. [2024-06-04 15:37:24,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 1615 events. 995/1615 cut-off events. For 4090/4092 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7997 event pairs, 349 based on Foata normal form. 2/1595 useless extension candidates. Maximal degree in co-relation 5732. Up to 1549 conditions per place. [2024-06-04 15:37:24,769 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 79 selfloop transitions, 24 changer transitions 0/109 dead transitions. [2024-06-04 15:37:24,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1115 flow [2024-06-04 15:37:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 15:37:24,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-04 15:37:24,771 INFO L175 Difference]: Start difference. First operand has 100 places, 102 transitions, 856 flow. Second operand 7 states and 116 transitions. [2024-06-04 15:37:24,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1115 flow [2024-06-04 15:37:24,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 1058 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 15:37:24,781 INFO L231 Difference]: Finished difference. Result has 104 places, 106 transitions, 903 flow [2024-06-04 15:37:24,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=903, PETRI_PLACES=104, PETRI_TRANSITIONS=106} [2024-06-04 15:37:24,781 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2024-06-04 15:37:24,781 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 106 transitions, 903 flow [2024-06-04 15:37:24,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:24,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:24,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:24,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 15:37:24,782 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:24,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash -132434307, now seen corresponding path program 4 times [2024-06-04 15:37:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512586513] [2024-06-04 15:37:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:24,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512586513] [2024-06-04 15:37:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512586513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:26,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:26,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:37:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60938197] [2024-06-04 15:37:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:26,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:37:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:26,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:37:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:37:26,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:26,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 903 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:26,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:26,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:26,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:27,289 INFO L124 PetriNetUnfolderBase]: 996/1617 cut-off events. [2024-06-04 15:37:27,290 INFO L125 PetriNetUnfolderBase]: For 4276/4276 co-relation queries the response was YES. [2024-06-04 15:37:27,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 1617 events. 996/1617 cut-off events. For 4276/4276 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8034 event pairs, 348 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 5819. Up to 1548 conditions per place. [2024-06-04 15:37:27,301 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 76 selfloop transitions, 29 changer transitions 0/111 dead transitions. [2024-06-04 15:37:27,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 111 transitions, 1151 flow [2024-06-04 15:37:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-04 15:37:27,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3945578231292517 [2024-06-04 15:37:27,303 INFO L175 Difference]: Start difference. First operand has 104 places, 106 transitions, 903 flow. Second operand 7 states and 116 transitions. [2024-06-04 15:37:27,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 111 transitions, 1151 flow [2024-06-04 15:37:27,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 111 transitions, 1105 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:27,312 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 950 flow [2024-06-04 15:37:27,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=950, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2024-06-04 15:37:27,313 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-04 15:37:27,313 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 950 flow [2024-06-04 15:37:27,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:27,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:27,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:27,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 15:37:27,314 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:27,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 612609153, now seen corresponding path program 5 times [2024-06-04 15:37:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034527053] [2024-06-04 15:37:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034527053] [2024-06-04 15:37:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034527053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:29,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:29,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:37:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772458173] [2024-06-04 15:37:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:37:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:37:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:37:29,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:29,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 950 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:29,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:29,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:29,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:30,079 INFO L124 PetriNetUnfolderBase]: 999/1622 cut-off events. [2024-06-04 15:37:30,079 INFO L125 PetriNetUnfolderBase]: For 4781/4783 co-relation queries the response was YES. [2024-06-04 15:37:30,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5981 conditions, 1622 events. 999/1622 cut-off events. For 4781/4783 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8037 event pairs, 316 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 5931. Up to 1495 conditions per place. [2024-06-04 15:37:30,092 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 90 selfloop transitions, 34 changer transitions 0/130 dead transitions. [2024-06-04 15:37:30,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 130 transitions, 1418 flow [2024-06-04 15:37:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 15:37:30,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-06-04 15:37:30,094 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 950 flow. Second operand 7 states and 131 transitions. [2024-06-04 15:37:30,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 130 transitions, 1418 flow [2024-06-04 15:37:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 130 transitions, 1343 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-04 15:37:30,105 INFO L231 Difference]: Finished difference. Result has 111 places, 116 transitions, 1052 flow [2024-06-04 15:37:30,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=111, PETRI_TRANSITIONS=116} [2024-06-04 15:37:30,105 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2024-06-04 15:37:30,105 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 116 transitions, 1052 flow [2024-06-04 15:37:30,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:30,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:30,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:30,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 15:37:30,106 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:30,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:30,107 INFO L85 PathProgramCache]: Analyzing trace with hash 612042783, now seen corresponding path program 6 times [2024-06-04 15:37:30,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263726836] [2024-06-04 15:37:30,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:32,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:32,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263726836] [2024-06-04 15:37:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263726836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:32,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 15:37:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302123157] [2024-06-04 15:37:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 15:37:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:32,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 15:37:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 15:37:32,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:32,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 116 transitions, 1052 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:32,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:32,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:32,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:33,009 INFO L124 PetriNetUnfolderBase]: 1000/1624 cut-off events. [2024-06-04 15:37:33,009 INFO L125 PetriNetUnfolderBase]: For 5944/5944 co-relation queries the response was YES. [2024-06-04 15:37:33,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 1624 events. 1000/1624 cut-off events. For 5944/5944 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8055 event pairs, 317 based on Foata normal form. 0/1603 useless extension candidates. Maximal degree in co-relation 6259. Up to 1497 conditions per place. [2024-06-04 15:37:33,019 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 39 changer transitions 0/129 dead transitions. [2024-06-04 15:37:33,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 129 transitions, 1436 flow [2024-06-04 15:37:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 15:37:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 15:37:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-04 15:37:33,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43197278911564624 [2024-06-04 15:37:33,021 INFO L175 Difference]: Start difference. First operand has 111 places, 116 transitions, 1052 flow. Second operand 7 states and 127 transitions. [2024-06-04 15:37:33,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 129 transitions, 1436 flow [2024-06-04 15:37:33,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 1323 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-04 15:37:33,033 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 1069 flow [2024-06-04 15:37:33,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1069, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2024-06-04 15:37:33,034 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places. [2024-06-04 15:37:33,034 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 1069 flow [2024-06-04 15:37:33,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:33,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:33,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:33,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 15:37:33,035 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:33,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -476306215, now seen corresponding path program 1 times [2024-06-04 15:37:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556308334] [2024-06-04 15:37:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556308334] [2024-06-04 15:37:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556308334] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:34,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648289008] [2024-06-04 15:37:34,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:34,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:34,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:34,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 1069 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:34,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:34,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:34,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:35,793 INFO L124 PetriNetUnfolderBase]: 1501/2338 cut-off events. [2024-06-04 15:37:35,793 INFO L125 PetriNetUnfolderBase]: For 8004/8264 co-relation queries the response was YES. [2024-06-04 15:37:35,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8370 conditions, 2338 events. 1501/2338 cut-off events. For 8004/8264 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11829 event pairs, 839 based on Foata normal form. 2/2339 useless extension candidates. Maximal degree in co-relation 8317. Up to 2246 conditions per place. [2024-06-04 15:37:35,804 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 31 changer transitions 0/131 dead transitions. [2024-06-04 15:37:35,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 131 transitions, 1430 flow [2024-06-04 15:37:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:37:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:37:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-04 15:37:35,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2024-06-04 15:37:35,805 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 1069 flow. Second operand 6 states and 113 transitions. [2024-06-04 15:37:35,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 131 transitions, 1430 flow [2024-06-04 15:37:35,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 131 transitions, 1357 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 15:37:35,817 INFO L231 Difference]: Finished difference. Result has 117 places, 125 transitions, 1165 flow [2024-06-04 15:37:35,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=117, PETRI_TRANSITIONS=125} [2024-06-04 15:37:35,818 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2024-06-04 15:37:35,818 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 125 transitions, 1165 flow [2024-06-04 15:37:35,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:35,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:35,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:35,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 15:37:35,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:35,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -458866855, now seen corresponding path program 2 times [2024-06-04 15:37:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234388647] [2024-06-04 15:37:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:35,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:37,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:37,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234388647] [2024-06-04 15:37:37,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234388647] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:37,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:37,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263233120] [2024-06-04 15:37:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:37,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:37,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:37,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 125 transitions, 1165 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:37,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:37,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:37,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:38,744 INFO L124 PetriNetUnfolderBase]: 1495/2329 cut-off events. [2024-06-04 15:37:38,744 INFO L125 PetriNetUnfolderBase]: For 8372/8597 co-relation queries the response was YES. [2024-06-04 15:37:38,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 2329 events. 1495/2329 cut-off events. For 8372/8597 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11754 event pairs, 834 based on Foata normal form. 2/2328 useless extension candidates. Maximal degree in co-relation 8691. Up to 2241 conditions per place. [2024-06-04 15:37:38,756 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2024-06-04 15:37:38,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 134 transitions, 1539 flow [2024-06-04 15:37:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:37:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:37:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-04 15:37:38,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 15:37:38,757 INFO L175 Difference]: Start difference. First operand has 117 places, 125 transitions, 1165 flow. Second operand 6 states and 108 transitions. [2024-06-04 15:37:38,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 134 transitions, 1539 flow [2024-06-04 15:37:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 134 transitions, 1495 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:38,769 INFO L231 Difference]: Finished difference. Result has 120 places, 130 transitions, 1281 flow [2024-06-04 15:37:38,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1281, PETRI_PLACES=120, PETRI_TRANSITIONS=130} [2024-06-04 15:37:38,769 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places. [2024-06-04 15:37:38,769 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 130 transitions, 1281 flow [2024-06-04 15:37:38,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:38,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:38,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:38,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 15:37:38,770 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:38,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -457668581, now seen corresponding path program 1 times [2024-06-04 15:37:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065203331] [2024-06-04 15:37:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:40,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065203331] [2024-06-04 15:37:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065203331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844003428] [2024-06-04 15:37:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:40,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:40,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:40,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 130 transitions, 1281 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:40,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:40,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:40,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:41,294 INFO L124 PetriNetUnfolderBase]: 1496/2332 cut-off events. [2024-06-04 15:37:41,294 INFO L125 PetriNetUnfolderBase]: For 9057/9252 co-relation queries the response was YES. [2024-06-04 15:37:41,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8998 conditions, 2332 events. 1496/2332 cut-off events. For 9057/9252 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11802 event pairs, 835 based on Foata normal form. 1/2332 useless extension candidates. Maximal degree in co-relation 8942. Up to 2270 conditions per place. [2024-06-04 15:37:41,308 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 113 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2024-06-04 15:37:41,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 1587 flow [2024-06-04 15:37:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:37:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:37:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-04 15:37:41,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2024-06-04 15:37:41,310 INFO L175 Difference]: Start difference. First operand has 120 places, 130 transitions, 1281 flow. Second operand 6 states and 106 transitions. [2024-06-04 15:37:41,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 1587 flow [2024-06-04 15:37:41,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 137 transitions, 1545 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:41,322 INFO L231 Difference]: Finished difference. Result has 124 places, 133 transitions, 1314 flow [2024-06-04 15:37:41,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=124, PETRI_TRANSITIONS=133} [2024-06-04 15:37:41,323 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 81 predicate places. [2024-06-04 15:37:41,323 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 133 transitions, 1314 flow [2024-06-04 15:37:41,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:41,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:41,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 15:37:41,323 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:41,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1023805589, now seen corresponding path program 2 times [2024-06-04 15:37:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:41,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867294924] [2024-06-04 15:37:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 15:37:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 15:37:43,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 15:37:43,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867294924] [2024-06-04 15:37:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867294924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 15:37:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 15:37:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 15:37:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879332614] [2024-06-04 15:37:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 15:37:43,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 15:37:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 15:37:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 15:37:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 15:37:43,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-06-04 15:37:43,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 133 transitions, 1314 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:43,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 15:37:43,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-06-04 15:37:43,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 15:37:43,922 INFO L124 PetriNetUnfolderBase]: 1494/2329 cut-off events. [2024-06-04 15:37:43,922 INFO L125 PetriNetUnfolderBase]: For 10716/10911 co-relation queries the response was YES. [2024-06-04 15:37:43,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9417 conditions, 2329 events. 1494/2329 cut-off events. For 10716/10911 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11741 event pairs, 808 based on Foata normal form. 1/2329 useless extension candidates. Maximal degree in co-relation 9358. Up to 2277 conditions per place. [2024-06-04 15:37:43,937 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 117 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2024-06-04 15:37:43,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 1608 flow [2024-06-04 15:37:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 15:37:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 15:37:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 15:37:43,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2024-06-04 15:37:43,938 INFO L175 Difference]: Start difference. First operand has 124 places, 133 transitions, 1314 flow. Second operand 6 states and 102 transitions. [2024-06-04 15:37:43,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 1608 flow [2024-06-04 15:37:43,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 1575 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 15:37:43,949 INFO L231 Difference]: Finished difference. Result has 127 places, 135 transitions, 1342 flow [2024-06-04 15:37:43,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1342, PETRI_PLACES=127, PETRI_TRANSITIONS=135} [2024-06-04 15:37:43,950 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places. [2024-06-04 15:37:43,950 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 135 transitions, 1342 flow [2024-06-04 15:37:43,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 15:37:43,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 15:37:43,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 15:37:43,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 15:37:43,951 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 15:37:43,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 15:37:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash -458853959, now seen corresponding path program 1 times [2024-06-04 15:37:43,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 15:37:43,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169011424] [2024-06-04 15:37:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 15:37:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 15:37:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:37:43,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-04 15:37:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-04 15:37:44,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-04 15:37:44,043 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-04 15:37:44,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-04 15:37:44,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-04 15:37:44,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-04 15:37:44,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-04 15:37:44,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-04 15:37:44,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-04 15:37:44,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 15:37:44,050 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-06-04 15:37:44,056 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 15:37:44,056 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 15:37:44,103 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,104 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,104 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,104 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,104 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,105 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,111 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,112 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,112 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,112 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,112 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,112 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,116 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,116 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,117 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,118 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,118 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-04 15:37:44,125 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-04 15:37:44,144 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-04 15:37:44,144 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-04 15:37:44,144 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 03:37:44 BasicIcfg [2024-06-04 15:37:44,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 15:37:44,145 INFO L158 Benchmark]: Toolchain (without parser) took 68504.52ms. Allocated memory was 176.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.4MB in the beginning and 929.4MB in the end (delta: -824.9MB). Peak memory consumption was 359.6MB. Max. memory is 16.1GB. [2024-06-04 15:37:44,145 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:37:44,145 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 15:37:44,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 863.84ms. Allocated memory is still 176.2MB. Free memory was 104.4MB in the beginning and 51.3MB in the end (delta: 53.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-06-04 15:37:44,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.75ms. Allocated memory is still 176.2MB. Free memory was 51.3MB in the beginning and 141.0MB in the end (delta: -89.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-06-04 15:37:44,146 INFO L158 Benchmark]: Boogie Preprocessor took 96.91ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 140.9MB in the beginning and 233.9MB in the end (delta: -92.9MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-06-04 15:37:44,147 INFO L158 Benchmark]: RCFGBuilder took 1648.38ms. Allocated memory is still 272.6MB. Free memory was 233.9MB in the beginning and 111.7MB in the end (delta: 122.1MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2024-06-04 15:37:44,147 INFO L158 Benchmark]: TraceAbstraction took 65770.52ms. Allocated memory was 272.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 111.7MB in the beginning and 929.4MB in the end (delta: -817.6MB). Peak memory consumption was 270.8MB. Max. memory is 16.1GB. [2024-06-04 15:37:44,148 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.16ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 176.2MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 863.84ms. Allocated memory is still 176.2MB. Free memory was 104.4MB in the beginning and 51.3MB in the end (delta: 53.2MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.75ms. Allocated memory is still 176.2MB. Free memory was 51.3MB in the beginning and 141.0MB in the end (delta: -89.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.91ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 140.9MB in the beginning and 233.9MB in the end (delta: -92.9MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1648.38ms. Allocated memory is still 272.6MB. Free memory was 233.9MB in the beginning and 111.7MB in the end (delta: 122.1MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65770.52ms. Allocated memory was 272.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 111.7MB in the beginning and 929.4MB in the end (delta: -817.6MB). Peak memory consumption was 270.8MB. 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: 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: 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: 877]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2121; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L872] 0 //@ ghost multithreaded = 1; [L872] FCALL, FORK 0 pthread_create(&t2121, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, 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] [L873] 0 pthread_t t2122; [L874] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_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_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] FCALL, FORK 0 pthread_create(&t2122, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, t2122=-1, 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] [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 x [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L874] 0 __unbuffered_p2_EAX$read_delayed_var [L875] 0 pthread_t t2123; [L876] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_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_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] FCALL, FORK 0 pthread_create(&t2123, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, t2122=-1, t2123=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] [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 x [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L876] 0 __unbuffered_p2_EAX$read_delayed_var [L827] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 3 x$flush_delayed = weak$$choice2 [L830] EXPR 3 \read(x) [L830] 3 x$mem_tmp = x [L831] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L832] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L832] EXPR 3 \read(x) [L832] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L832] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L833] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L834] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L835] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L836] 3 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_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L837] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L838] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L839] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L840] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L841] EXPR 3 \read(x) [L841] 3 __unbuffered_p2_EAX = x [L842] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L842] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L842] 3 x = x$flush_delayed ? x$mem_tmp : x [L843] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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] [L877] 0 //@ assert ((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff0) && (x$w_buff0 <= 2)) && (x$w_buff0 <= 127)) && (((x$w_buff0 == 0) || (x$w_buff0 == 1)) || (x$w_buff0 == 2))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_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_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$w_buff1) && (x$w_buff1 <= 2)) && (x$w_buff1 <= 127)) && (((x$w_buff1 == 0) || (x$w_buff1 == 1)) || (x$w_buff1 == 2))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2121=-2, t2122=-1, t2123=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: 874]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 876]: 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: 874]: 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, 68 locations, 6 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: 65.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4374 IncrementalHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 58 mSDtfsCounter, 4374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1342occurred in iteration=24, InterpolantAutomatonStates: 145, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 43.9s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 27872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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-06-04 15:37:44,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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