./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/safe020_power.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i ./goblint.2024-05-07_14-17-48.files/protection/safe020_power.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:40:21,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:40:21,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:40:21,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:40:21,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:40:21,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:40:21,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:40:21,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:40:21,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:40:21,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:40:21,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:40:21,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:40:21,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:40:21,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:40:21,555 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:40:21,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:40:21,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:40:21,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:40:21,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:40:21,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:40:21,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:40:21,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:40:21,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:40:21,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:40:21,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:40:21,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:40:21,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:40:21,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:40:21,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:40:21,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:40:21,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:40:21,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:40:21,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:40:21,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:40:21,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:40:21,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:40:21,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:40:21,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:40:21,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:40:21,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:40:21,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:40:21,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:40:21,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:40:21,564 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 13:40:21,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:40:21,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:40:21,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:40:21,776 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:40:21,776 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:40:21,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/safe020_power.yml/witness.yml [2024-05-12 13:40:21,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:40:21,975 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:40:21,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i [2024-05-12 13:40:23,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:40:23,219 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:40:23,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i [2024-05-12 13:40:23,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bfc405e/98ec561598f34c70a3cf8fb7b2bc8f11/FLAG872af5fea [2024-05-12 13:40:23,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16bfc405e/98ec561598f34c70a3cf8fb7b2bc8f11 [2024-05-12 13:40:23,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:40:23,259 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:40:23,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:40:23,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:40:23,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:40:23,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:40:21" (1/2) ... [2024-05-12 13:40:23,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5960c018 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:40:23, skipping insertion in model container [2024-05-12 13:40:23,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:40:21" (1/2) ... [2024-05-12 13:40:23,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@121c3c6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:40:23, skipping insertion in model container [2024-05-12 13:40:23,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:40:23" (2/2) ... [2024-05-12 13:40:23,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5960c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23, skipping insertion in model container [2024-05-12 13:40:23,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:40:23" (2/2) ... [2024-05-12 13:40:23,270 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:40:23,362 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:40:23,363 INFO L97 edCorrectnessWitness]: Location invariant before [L862-L862] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! 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 <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! 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 <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! 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 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-05-12 13:40:23,363 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! 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 <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! 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 <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! 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 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-05-12 13:40:23,363 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] (((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! 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 <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! 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 <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! 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 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-05-12 13:40:23,363 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:40:23,364 INFO L106 edCorrectnessWitness]: ghost_update [L860-L860] multithreaded = 1; [2024-05-12 13:40:23,406 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:40:23,573 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i[990,1003] [2024-05-12 13:40:23,771 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:40:23,779 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:40:23,811 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i[990,1003] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:40:23,910 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:40:23,954 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:40:23,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23 WrapperNode [2024-05-12 13:40:23,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:40:23,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:40:23,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:40:23,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:40:23,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:23,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,010 INFO L138 Inliner]: procedures = 176, calls = 101, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 254 [2024-05-12 13:40:24,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:40:24,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:40:24,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:40:24,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:40:24,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,042 INFO L175 MemorySlicer]: Split 51 memory accesses to 5 slices as follows [46, 2, 1, 1, 1]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2, 0, 0, 0]. The 10 writes are split as follows [7, 0, 1, 1, 1]. [2024-05-12 13:40:24,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:40:24,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:40:24,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:40:24,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:40:24,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (1/1) ... [2024-05-12 13:40:24,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:40:24,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:40:24,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 13:40:24,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 13:40:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:40:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:40:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 13:40:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 13:40:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:40:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:40:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:40:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:40:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:40:24,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:40:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:40:24,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:40:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 13:40:24,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:40:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:40:24,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:40:24,162 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:40:24,362 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:40:24,364 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:40:24,841 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:40:24,841 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:40:25,181 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:40:25,181 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:40:25,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:40:25 BoogieIcfgContainer [2024-05-12 13:40:25,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:40:25,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:40:25,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:40:25,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:40:25,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:40:21" (1/4) ... [2024-05-12 13:40:25,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328e0766 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:40:25, skipping insertion in model container [2024-05-12 13:40:25,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:40:23" (2/4) ... [2024-05-12 13:40:25,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328e0766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:40:25, skipping insertion in model container [2024-05-12 13:40:25,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:40:23" (3/4) ... [2024-05-12 13:40:25,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328e0766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:40:25, skipping insertion in model container [2024-05-12 13:40:25,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:40:25" (4/4) ... [2024-05-12 13:40:25,193 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2024-05-12 13:40:25,208 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:40:25,209 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 13:40:25,209 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:40:25,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:40:25,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:40:25,329 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 13:40:25,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:40:25,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 13:40:25,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:40:25,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 44 transitions, 97 flow [2024-05-12 13:40:25,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:40:25,355 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;@4316cf4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:40:25,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 13:40:25,394 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:40:25,394 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:40:25,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:40:25,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:25,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:40:25,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:25,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 799772418, now seen corresponding path program 1 times [2024-05-12 13:40:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:25,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699488933] [2024-05-12 13:40:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699488933] [2024-05-12 13:40:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699488933] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:27,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:27,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:40:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764736464] [2024-05-12 13:40:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:27,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:40:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:40:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:40:27,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:27,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:27,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:27,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:27,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:28,648 INFO L124 PetriNetUnfolderBase]: 3979/6280 cut-off events. [2024-05-12 13:40:28,648 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-05-12 13:40:28,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12068 conditions, 6280 events. 3979/6280 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 38365 event pairs, 2553 based on Foata normal form. 180/5989 useless extension candidates. Maximal degree in co-relation 12053. Up to 5697 conditions per place. [2024-05-12 13:40:28,682 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 41 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2024-05-12 13:40:28,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 235 flow [2024-05-12 13:40:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:40:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:40:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-05-12 13:40:28,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 13:40:28,694 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 97 flow. Second operand 4 states and 104 transitions. [2024-05-12 13:40:28,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 235 flow [2024-05-12 13:40:28,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 13:40:28,703 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 153 flow [2024-05-12 13:40:28,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2024-05-12 13:40:28,707 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-05-12 13:40:28,708 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 153 flow [2024-05-12 13:40:28,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:28,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:28,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:28,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:40:28,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:28,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -217817503, now seen corresponding path program 1 times [2024-05-12 13:40:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:28,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92277927] [2024-05-12 13:40:28,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92277927] [2024-05-12 13:40:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92277927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:40:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750391851] [2024-05-12 13:40:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:40:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:40:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:40:30,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:30,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:40:30,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:30,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:30,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:31,426 INFO L124 PetriNetUnfolderBase]: 3981/6274 cut-off events. [2024-05-12 13:40:31,427 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-05-12 13:40:31,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13487 conditions, 6274 events. 3981/6274 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38737 event pairs, 1701 based on Foata normal form. 0/5801 useless extension candidates. Maximal degree in co-relation 13471. Up to 5649 conditions per place. [2024-05-12 13:40:31,456 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 46 selfloop transitions, 18 changer transitions 0/74 dead transitions. [2024-05-12 13:40:31,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 347 flow [2024-05-12 13:40:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:40:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:40:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-05-12 13:40:31,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276595744680851 [2024-05-12 13:40:31,459 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 153 flow. Second operand 5 states and 124 transitions. [2024-05-12 13:40:31,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 347 flow [2024-05-12 13:40:31,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 13:40:31,461 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 257 flow [2024-05-12 13:40:31,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-05-12 13:40:31,462 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-05-12 13:40:31,462 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 257 flow [2024-05-12 13:40:31,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:40:31,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:31,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:31,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:40:31,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:31,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash -216774973, now seen corresponding path program 2 times [2024-05-12 13:40:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:31,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563953054] [2024-05-12 13:40:31,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563953054] [2024-05-12 13:40:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563953054] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:40:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36071035] [2024-05-12 13:40:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:32,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:40:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:40:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:40:32,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:32,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:40:32,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:32,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:32,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:33,836 INFO L124 PetriNetUnfolderBase]: 3979/6281 cut-off events. [2024-05-12 13:40:33,837 INFO L125 PetriNetUnfolderBase]: For 2359/2359 co-relation queries the response was YES. [2024-05-12 13:40:33,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14965 conditions, 6281 events. 3979/6281 cut-off events. For 2359/2359 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 38541 event pairs, 1744 based on Foata normal form. 2/5817 useless extension candidates. Maximal degree in co-relation 14945. Up to 5648 conditions per place. [2024-05-12 13:40:33,869 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 55 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2024-05-12 13:40:33,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 447 flow [2024-05-12 13:40:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:40:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:40:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-05-12 13:40:33,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-05-12 13:40:33,871 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 257 flow. Second operand 5 states and 135 transitions. [2024-05-12 13:40:33,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 447 flow [2024-05-12 13:40:33,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 435 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-05-12 13:40:33,876 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 282 flow [2024-05-12 13:40:33,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-05-12 13:40:33,877 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-05-12 13:40:33,877 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 282 flow [2024-05-12 13:40:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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-05-12 13:40:33,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:33,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:33,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:40:33,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:33,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1837435185, now seen corresponding path program 1 times [2024-05-12 13:40:33,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:33,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709864172] [2024-05-12 13:40:33,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:33,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709864172] [2024-05-12 13:40:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709864172] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:40:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928376378] [2024-05-12 13:40:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:35,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:40:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:40:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:40:35,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:35,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:35,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:35,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:35,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:36,252 INFO L124 PetriNetUnfolderBase]: 4024/6350 cut-off events. [2024-05-12 13:40:36,253 INFO L125 PetriNetUnfolderBase]: For 1474/1476 co-relation queries the response was YES. [2024-05-12 13:40:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14299 conditions, 6350 events. 4024/6350 cut-off events. For 1474/1476 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 39157 event pairs, 2137 based on Foata normal form. 0/5852 useless extension candidates. Maximal degree in co-relation 14276. Up to 5769 conditions per place. [2024-05-12 13:40:36,286 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 50 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2024-05-12 13:40:36,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 457 flow [2024-05-12 13:40:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:40:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:40:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-05-12 13:40:36,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2024-05-12 13:40:36,290 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 282 flow. Second operand 5 states and 118 transitions. [2024-05-12 13:40:36,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 457 flow [2024-05-12 13:40:36,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 404 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 13:40:36,294 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 306 flow [2024-05-12 13:40:36,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-05-12 13:40:36,296 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-05-12 13:40:36,296 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 306 flow [2024-05-12 13:40:36,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:36,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:36,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:36,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:40:36,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:36,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1837436674, now seen corresponding path program 1 times [2024-05-12 13:40:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378695795] [2024-05-12 13:40:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:36,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:36,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378695795] [2024-05-12 13:40:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378695795] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:40:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869513316] [2024-05-12 13:40:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:36,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:40:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:36,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:40:36,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:40:36,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-05-12 13:40:36,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:36,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:36,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-05-12 13:40:36,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:36,831 INFO L124 PetriNetUnfolderBase]: 1441/2679 cut-off events. [2024-05-12 13:40:36,831 INFO L125 PetriNetUnfolderBase]: For 534/546 co-relation queries the response was YES. [2024-05-12 13:40:36,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 2679 events. 1441/2679 cut-off events. For 534/546 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17843 event pairs, 662 based on Foata normal form. 0/2581 useless extension candidates. Maximal degree in co-relation 5533. Up to 1777 conditions per place. [2024-05-12 13:40:36,843 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 51 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-05-12 13:40:36,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 430 flow [2024-05-12 13:40:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:40:36,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:40:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2024-05-12 13:40:36,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7092198581560284 [2024-05-12 13:40:36,845 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 306 flow. Second operand 3 states and 100 transitions. [2024-05-12 13:40:36,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 430 flow [2024-05-12 13:40:36,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:40:36,848 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 276 flow [2024-05-12 13:40:36,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2024-05-12 13:40:36,850 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2024-05-12 13:40:36,850 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 276 flow [2024-05-12 13:40:36,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:36,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:36,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:40:36,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:36,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash 544896562, now seen corresponding path program 1 times [2024-05-12 13:40:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014299758] [2024-05-12 13:40:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:38,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:38,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014299758] [2024-05-12 13:40:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014299758] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:38,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:40:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972021433] [2024-05-12 13:40:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:38,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:40:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:40:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:40:38,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:38,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 276 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:38,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:38,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:38,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:39,688 INFO L124 PetriNetUnfolderBase]: 3312/5262 cut-off events. [2024-05-12 13:40:39,688 INFO L125 PetriNetUnfolderBase]: For 1850/1852 co-relation queries the response was YES. [2024-05-12 13:40:39,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11897 conditions, 5262 events. 3312/5262 cut-off events. For 1850/1852 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 31483 event pairs, 1598 based on Foata normal form. 0/5087 useless extension candidates. Maximal degree in co-relation 11872. Up to 4714 conditions per place. [2024-05-12 13:40:39,713 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 54 selfloop transitions, 19 changer transitions 1/84 dead transitions. [2024-05-12 13:40:39,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 494 flow [2024-05-12 13:40:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:40:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:40:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-05-12 13:40:39,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 13:40:39,716 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 276 flow. Second operand 6 states and 147 transitions. [2024-05-12 13:40:39,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 494 flow [2024-05-12 13:40:39,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:40:39,719 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 343 flow [2024-05-12 13:40:39,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-05-12 13:40:39,722 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2024-05-12 13:40:39,723 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 343 flow [2024-05-12 13:40:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:39,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:39,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:40:39,723 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:39,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 523408912, now seen corresponding path program 2 times [2024-05-12 13:40:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008175675] [2024-05-12 13:40:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008175675] [2024-05-12 13:40:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008175675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:40:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125072044] [2024-05-12 13:40:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:41,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:40:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:41,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:40:41,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:40:41,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:41,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 343 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:41,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:41,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:41,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:42,334 INFO L124 PetriNetUnfolderBase]: 2943/4733 cut-off events. [2024-05-12 13:40:42,334 INFO L125 PetriNetUnfolderBase]: For 1545/1547 co-relation queries the response was YES. [2024-05-12 13:40:42,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10636 conditions, 4733 events. 2943/4733 cut-off events. For 1545/1547 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 28587 event pairs, 1239 based on Foata normal form. 0/4559 useless extension candidates. Maximal degree in co-relation 10608. Up to 4196 conditions per place. [2024-05-12 13:40:42,357 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 46 selfloop transitions, 22 changer transitions 0/78 dead transitions. [2024-05-12 13:40:42,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 527 flow [2024-05-12 13:40:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:40:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:40:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-05-12 13:40:42,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 13:40:42,359 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 343 flow. Second operand 6 states and 135 transitions. [2024-05-12 13:40:42,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 527 flow [2024-05-12 13:40:42,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 78 transitions, 498 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:40:42,361 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 390 flow [2024-05-12 13:40:42,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2024-05-12 13:40:42,362 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2024-05-12 13:40:42,362 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 390 flow [2024-05-12 13:40:42,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:42,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:42,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:42,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:40:42,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:42,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash 545067217, now seen corresponding path program 1 times [2024-05-12 13:40:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706584190] [2024-05-12 13:40:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:43,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706584190] [2024-05-12 13:40:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706584190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:40:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535935529] [2024-05-12 13:40:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:43,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:40:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:40:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:40:43,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:43,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:43,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:43,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:43,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:44,707 INFO L124 PetriNetUnfolderBase]: 2947/4745 cut-off events. [2024-05-12 13:40:44,708 INFO L125 PetriNetUnfolderBase]: For 1577/1581 co-relation queries the response was YES. [2024-05-12 13:40:44,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10717 conditions, 4745 events. 2947/4745 cut-off events. For 1577/1581 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28354 event pairs, 1728 based on Foata normal form. 2/4574 useless extension candidates. Maximal degree in co-relation 10688. Up to 4253 conditions per place. [2024-05-12 13:40:44,728 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 58 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2024-05-12 13:40:44,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 82 transitions, 599 flow [2024-05-12 13:40:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:40:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:40:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-05-12 13:40:44,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2024-05-12 13:40:44,729 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 390 flow. Second operand 6 states and 130 transitions. [2024-05-12 13:40:44,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 82 transitions, 599 flow [2024-05-12 13:40:44,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 568 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 13:40:44,732 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 462 flow [2024-05-12 13:40:44,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2024-05-12 13:40:44,733 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-05-12 13:40:44,733 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 462 flow [2024-05-12 13:40:44,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:44,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:44,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:44,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:40:44,734 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:44,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 545112787, now seen corresponding path program 2 times [2024-05-12 13:40:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282493099] [2024-05-12 13:40:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:46,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282493099] [2024-05-12 13:40:46,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282493099] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:46,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:40:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491931672] [2024-05-12 13:40:46,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:46,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:40:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:40:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:40:46,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:46,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 462 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:46,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:46,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:46,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:47,331 INFO L124 PetriNetUnfolderBase]: 2950/4749 cut-off events. [2024-05-12 13:40:47,331 INFO L125 PetriNetUnfolderBase]: For 2603/2609 co-relation queries the response was YES. [2024-05-12 13:40:47,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11429 conditions, 4749 events. 2950/4749 cut-off events. For 2603/2609 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28159 event pairs, 1680 based on Foata normal form. 1/4578 useless extension candidates. Maximal degree in co-relation 11397. Up to 4241 conditions per place. [2024-05-12 13:40:47,352 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 69 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2024-05-12 13:40:47,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 752 flow [2024-05-12 13:40:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:40:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:40:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-05-12 13:40:47,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47416413373860183 [2024-05-12 13:40:47,354 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 462 flow. Second operand 7 states and 156 transitions. [2024-05-12 13:40:47,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 752 flow [2024-05-12 13:40:47,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 100 transitions, 718 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 13:40:47,360 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 581 flow [2024-05-12 13:40:47,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=581, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2024-05-12 13:40:47,361 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2024-05-12 13:40:47,361 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 581 flow [2024-05-12 13:40:47,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:47,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:47,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:40:47,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:47,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -43578951, now seen corresponding path program 1 times [2024-05-12 13:40:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:47,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810542838] [2024-05-12 13:40:47,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810542838] [2024-05-12 13:40:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810542838] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:49,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:40:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143937639] [2024-05-12 13:40:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:40:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:40:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:40:49,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:49,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 581 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:49,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:49,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:49,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:50,507 INFO L124 PetriNetUnfolderBase]: 2931/4728 cut-off events. [2024-05-12 13:40:50,508 INFO L125 PetriNetUnfolderBase]: For 4999/5041 co-relation queries the response was YES. [2024-05-12 13:40:50,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12521 conditions, 4728 events. 2931/4728 cut-off events. For 4999/5041 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28251 event pairs, 1208 based on Foata normal form. 3/4577 useless extension candidates. Maximal degree in co-relation 12485. Up to 4178 conditions per place. [2024-05-12 13:40:50,533 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 64 selfloop transitions, 26 changer transitions 0/100 dead transitions. [2024-05-12 13:40:50,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 100 transitions, 801 flow [2024-05-12 13:40:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:40:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:40:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-05-12 13:40:50,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45288753799392095 [2024-05-12 13:40:50,534 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 581 flow. Second operand 7 states and 149 transitions. [2024-05-12 13:40:50,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 100 transitions, 801 flow [2024-05-12 13:40:50,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 100 transitions, 755 flow, removed 18 selfloop flow, removed 2 redundant places. [2024-05-12 13:40:50,541 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 612 flow [2024-05-12 13:40:50,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2024-05-12 13:40:50,542 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2024-05-12 13:40:50,542 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 612 flow [2024-05-12 13:40:50,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:50,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:50,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:50,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:40:50,543 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:50,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 811133057, now seen corresponding path program 2 times [2024-05-12 13:40:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627235467] [2024-05-12 13:40:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:52,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627235467] [2024-05-12 13:40:52,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627235467] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:52,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:52,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:40:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13901904] [2024-05-12 13:40:52,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:52,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:40:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:40:52,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:40:52,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:52,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:52,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:52,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:52,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:53,457 INFO L124 PetriNetUnfolderBase]: 2933/4739 cut-off events. [2024-05-12 13:40:53,458 INFO L125 PetriNetUnfolderBase]: For 5491/5537 co-relation queries the response was YES. [2024-05-12 13:40:53,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12868 conditions, 4739 events. 2933/4739 cut-off events. For 5491/5537 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28141 event pairs, 1310 based on Foata normal form. 5/4591 useless extension candidates. Maximal degree in co-relation 12830. Up to 4182 conditions per place. [2024-05-12 13:40:53,482 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 72 selfloop transitions, 27 changer transitions 0/109 dead transitions. [2024-05-12 13:40:53,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 109 transitions, 883 flow [2024-05-12 13:40:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:40:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:40:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-05-12 13:40:53,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 13:40:53,484 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 612 flow. Second operand 7 states and 161 transitions. [2024-05-12 13:40:53,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 109 transitions, 883 flow [2024-05-12 13:40:53,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 827 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-05-12 13:40:53,493 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 653 flow [2024-05-12 13:40:53,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=653, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2024-05-12 13:40:53,493 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2024-05-12 13:40:53,508 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 653 flow [2024-05-12 13:40:53,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:53,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:53,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:53,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:40:53,509 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:53,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -325672778, now seen corresponding path program 1 times [2024-05-12 13:40:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949102031] [2024-05-12 13:40:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949102031] [2024-05-12 13:40:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949102031] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:40:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417005035] [2024-05-12 13:40:54,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:54,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:40:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:54,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:40:54,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:40:54,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:54,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 653 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:54,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:54,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:55,942 INFO L124 PetriNetUnfolderBase]: 3294/5245 cut-off events. [2024-05-12 13:40:55,943 INFO L125 PetriNetUnfolderBase]: For 6479/6525 co-relation queries the response was YES. [2024-05-12 13:40:55,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14512 conditions, 5245 events. 3294/5245 cut-off events. For 6479/6525 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31145 event pairs, 2111 based on Foata normal form. 1/4944 useless extension candidates. Maximal degree in co-relation 14472. Up to 4745 conditions per place. [2024-05-12 13:40:55,970 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 76 selfloop transitions, 17 changer transitions 0/103 dead transitions. [2024-05-12 13:40:55,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 103 transitions, 900 flow [2024-05-12 13:40:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:40:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:40:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-05-12 13:40:55,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2024-05-12 13:40:55,972 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 653 flow. Second operand 5 states and 115 transitions. [2024-05-12 13:40:55,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 103 transitions, 900 flow [2024-05-12 13:40:55,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 103 transitions, 836 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 13:40:55,979 INFO L231 Difference]: Finished difference. Result has 96 places, 99 transitions, 696 flow [2024-05-12 13:40:55,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=696, PETRI_PLACES=96, PETRI_TRANSITIONS=99} [2024-05-12 13:40:55,980 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2024-05-12 13:40:55,980 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 99 transitions, 696 flow [2024-05-12 13:40:55,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:55,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:55,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:55,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:40:55,981 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:55,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash -281324381, now seen corresponding path program 1 times [2024-05-12 13:40:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957867992] [2024-05-12 13:40:55,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:40:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:40:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:40:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957867992] [2024-05-12 13:40:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957867992] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:40:57,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:40:57,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:40:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358840430] [2024-05-12 13:40:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:40:57,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:40:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:40:57,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:40:57,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:40:57,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:40:57,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 99 transitions, 696 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:57,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:40:57,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:40:57,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:40:59,162 INFO L124 PetriNetUnfolderBase]: 2951/4768 cut-off events. [2024-05-12 13:40:59,162 INFO L125 PetriNetUnfolderBase]: For 6226/6359 co-relation queries the response was YES. [2024-05-12 13:40:59,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13559 conditions, 4768 events. 2951/4768 cut-off events. For 6226/6359 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28357 event pairs, 1785 based on Foata normal form. 2/4620 useless extension candidates. Maximal degree in co-relation 13516. Up to 4224 conditions per place. [2024-05-12 13:40:59,182 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 80 selfloop transitions, 38 changer transitions 0/128 dead transitions. [2024-05-12 13:40:59,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 128 transitions, 1072 flow [2024-05-12 13:40:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:40:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:40:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-05-12 13:40:59,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015197568389058 [2024-05-12 13:40:59,183 INFO L175 Difference]: Start difference. First operand has 96 places, 99 transitions, 696 flow. Second operand 7 states and 165 transitions. [2024-05-12 13:40:59,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 128 transitions, 1072 flow [2024-05-12 13:40:59,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 128 transitions, 1056 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 13:40:59,191 INFO L231 Difference]: Finished difference. Result has 103 places, 111 transitions, 888 flow [2024-05-12 13:40:59,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=888, PETRI_PLACES=103, PETRI_TRANSITIONS=111} [2024-05-12 13:40:59,191 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2024-05-12 13:40:59,192 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 888 flow [2024-05-12 13:40:59,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:40:59,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:40:59,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:40:59,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:40:59,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:40:59,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:40:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1870203107, now seen corresponding path program 3 times [2024-05-12 13:40:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:40:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017016258] [2024-05-12 13:40:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:40:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:40:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017016258] [2024-05-12 13:41:01,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017016258] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:01,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607337124] [2024-05-12 13:41:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:01,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:01,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:01,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:01,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 111 transitions, 888 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:01,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:01,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:01,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:02,449 INFO L124 PetriNetUnfolderBase]: 2929/4737 cut-off events. [2024-05-12 13:41:02,449 INFO L125 PetriNetUnfolderBase]: For 8910/9111 co-relation queries the response was YES. [2024-05-12 13:41:02,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14622 conditions, 4737 events. 2929/4737 cut-off events. For 8910/9111 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28357 event pairs, 1177 based on Foata normal form. 3/4587 useless extension candidates. Maximal degree in co-relation 14575. Up to 4176 conditions per place. [2024-05-12 13:41:02,471 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 96 selfloop transitions, 36 changer transitions 0/142 dead transitions. [2024-05-12 13:41:02,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 1310 flow [2024-05-12 13:41:02,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 13:41:02,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227963525835866 [2024-05-12 13:41:02,473 INFO L175 Difference]: Start difference. First operand has 103 places, 111 transitions, 888 flow. Second operand 7 states and 172 transitions. [2024-05-12 13:41:02,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 1310 flow [2024-05-12 13:41:02,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 142 transitions, 1234 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:02,486 INFO L231 Difference]: Finished difference. Result has 110 places, 120 transitions, 1004 flow [2024-05-12 13:41:02,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1004, PETRI_PLACES=110, PETRI_TRANSITIONS=120} [2024-05-12 13:41:02,487 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2024-05-12 13:41:02,487 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 1004 flow [2024-05-12 13:41:02,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:02,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:02,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:02,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 13:41:02,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:02,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1871364677, now seen corresponding path program 4 times [2024-05-12 13:41:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817006087] [2024-05-12 13:41:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817006087] [2024-05-12 13:41:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817006087] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364515162] [2024-05-12 13:41:04,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:04,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:04,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:04,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 120 transitions, 1004 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:04,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:04,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:04,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:05,541 INFO L124 PetriNetUnfolderBase]: 2928/4734 cut-off events. [2024-05-12 13:41:05,541 INFO L125 PetriNetUnfolderBase]: For 9009/9200 co-relation queries the response was YES. [2024-05-12 13:41:05,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14731 conditions, 4734 events. 2928/4734 cut-off events. For 9009/9200 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28586 event pairs, 823 based on Foata normal form. 3/4584 useless extension candidates. Maximal degree in co-relation 14681. Up to 4116 conditions per place. [2024-05-12 13:41:05,569 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 105 selfloop transitions, 38 changer transitions 0/153 dead transitions. [2024-05-12 13:41:05,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 1423 flow [2024-05-12 13:41:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-05-12 13:41:05,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5501519756838906 [2024-05-12 13:41:05,571 INFO L175 Difference]: Start difference. First operand has 110 places, 120 transitions, 1004 flow. Second operand 7 states and 181 transitions. [2024-05-12 13:41:05,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 1423 flow [2024-05-12 13:41:05,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1358 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 13:41:05,586 INFO L231 Difference]: Finished difference. Result has 111 places, 122 transitions, 1038 flow [2024-05-12 13:41:05,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1038, PETRI_PLACES=111, PETRI_TRANSITIONS=122} [2024-05-12 13:41:05,587 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 58 predicate places. [2024-05-12 13:41:05,587 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 122 transitions, 1038 flow [2024-05-12 13:41:05,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:05,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:05,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:05,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 13:41:05,588 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:05,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:05,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1654548670, now seen corresponding path program 1 times [2024-05-12 13:41:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:05,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076504301] [2024-05-12 13:41:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:07,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:07,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:07,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076504301] [2024-05-12 13:41:07,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076504301] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:07,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:07,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:07,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426270860] [2024-05-12 13:41:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:07,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:07,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:07,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:07,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:07,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 122 transitions, 1038 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:07,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:07,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:08,421 INFO L124 PetriNetUnfolderBase]: 3012/4862 cut-off events. [2024-05-12 13:41:08,422 INFO L125 PetriNetUnfolderBase]: For 10532/10681 co-relation queries the response was YES. [2024-05-12 13:41:08,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15637 conditions, 4862 events. 3012/4862 cut-off events. For 10532/10681 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29020 event pairs, 1155 based on Foata normal form. 5/4717 useless extension candidates. Maximal degree in co-relation 15589. Up to 4286 conditions per place. [2024-05-12 13:41:08,447 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 120 selfloop transitions, 32 changer transitions 0/161 dead transitions. [2024-05-12 13:41:08,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 161 transitions, 1593 flow [2024-05-12 13:41:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-05-12 13:41:08,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2024-05-12 13:41:08,449 INFO L175 Difference]: Start difference. First operand has 111 places, 122 transitions, 1038 flow. Second operand 8 states and 187 transitions. [2024-05-12 13:41:08,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 161 transitions, 1593 flow [2024-05-12 13:41:08,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 161 transitions, 1484 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 13:41:08,465 INFO L231 Difference]: Finished difference. Result has 114 places, 138 transitions, 1191 flow [2024-05-12 13:41:08,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1191, PETRI_PLACES=114, PETRI_TRANSITIONS=138} [2024-05-12 13:41:08,465 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 61 predicate places. [2024-05-12 13:41:08,466 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 138 transitions, 1191 flow [2024-05-12 13:41:08,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:08,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:08,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:08,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 13:41:08,466 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:08,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -340355952, now seen corresponding path program 2 times [2024-05-12 13:41:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:08,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961236772] [2024-05-12 13:41:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:10,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-05-12 13:41:10,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961236772] [2024-05-12 13:41:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961236772] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328758473] [2024-05-12 13:41:10,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:10,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:10,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:10,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:10,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 138 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:10,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:10,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:10,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:11,342 INFO L124 PetriNetUnfolderBase]: 3016/4868 cut-off events. [2024-05-12 13:41:11,342 INFO L125 PetriNetUnfolderBase]: For 15439/15588 co-relation queries the response was YES. [2024-05-12 13:41:11,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17270 conditions, 4868 events. 3016/4868 cut-off events. For 15439/15588 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29120 event pairs, 1166 based on Foata normal form. 3/4721 useless extension candidates. Maximal degree in co-relation 17220. Up to 4332 conditions per place. [2024-05-12 13:41:11,377 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 121 selfloop transitions, 26 changer transitions 0/156 dead transitions. [2024-05-12 13:41:11,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 156 transitions, 1594 flow [2024-05-12 13:41:11,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-05-12 13:41:11,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48024316109422494 [2024-05-12 13:41:11,379 INFO L175 Difference]: Start difference. First operand has 114 places, 138 transitions, 1191 flow. Second operand 7 states and 158 transitions. [2024-05-12 13:41:11,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 156 transitions, 1594 flow [2024-05-12 13:41:11,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 156 transitions, 1505 flow, removed 38 selfloop flow, removed 2 redundant places. [2024-05-12 13:41:11,403 INFO L231 Difference]: Finished difference. Result has 121 places, 144 transitions, 1252 flow [2024-05-12 13:41:11,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1252, PETRI_PLACES=121, PETRI_TRANSITIONS=144} [2024-05-12 13:41:11,403 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 68 predicate places. [2024-05-12 13:41:11,404 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 144 transitions, 1252 flow [2024-05-12 13:41:11,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:11,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:11,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:11,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 13:41:11,404 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:11,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1616505160, now seen corresponding path program 3 times [2024-05-12 13:41:11,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:11,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871430325] [2024-05-12 13:41:11,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871430325] [2024-05-12 13:41:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871430325] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893207923] [2024-05-12 13:41:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:12,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:12,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:12,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 144 transitions, 1252 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:14,233 INFO L124 PetriNetUnfolderBase]: 3016/4865 cut-off events. [2024-05-12 13:41:14,233 INFO L125 PetriNetUnfolderBase]: For 17954/18103 co-relation queries the response was YES. [2024-05-12 13:41:14,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17789 conditions, 4865 events. 3016/4865 cut-off events. For 17954/18103 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29078 event pairs, 1167 based on Foata normal form. 6/4720 useless extension candidates. Maximal degree in co-relation 17735. Up to 4332 conditions per place. [2024-05-12 13:41:14,258 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 120 selfloop transitions, 27 changer transitions 0/156 dead transitions. [2024-05-12 13:41:14,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 156 transitions, 1636 flow [2024-05-12 13:41:14,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-05-12 13:41:14,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44984802431610943 [2024-05-12 13:41:14,259 INFO L175 Difference]: Start difference. First operand has 121 places, 144 transitions, 1252 flow. Second operand 7 states and 148 transitions. [2024-05-12 13:41:14,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 156 transitions, 1636 flow [2024-05-12 13:41:14,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 156 transitions, 1558 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-05-12 13:41:14,282 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 1309 flow [2024-05-12 13:41:14,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1309, PETRI_PLACES=125, PETRI_TRANSITIONS=149} [2024-05-12 13:41:14,283 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2024-05-12 13:41:14,283 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 1309 flow [2024-05-12 13:41:14,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:14,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:14,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:14,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 13:41:14,284 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:14,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1478528082, now seen corresponding path program 4 times [2024-05-12 13:41:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499586451] [2024-05-12 13:41:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499586451] [2024-05-12 13:41:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499586451] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042950468] [2024-05-12 13:41:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:15,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:15,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 149 transitions, 1309 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:15,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:15,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:15,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:16,923 INFO L124 PetriNetUnfolderBase]: 3020/4872 cut-off events. [2024-05-12 13:41:16,923 INFO L125 PetriNetUnfolderBase]: For 20969/21114 co-relation queries the response was YES. [2024-05-12 13:41:16,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18373 conditions, 4872 events. 3020/4872 cut-off events. For 20969/21114 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29116 event pairs, 1167 based on Foata normal form. 2/4723 useless extension candidates. Maximal degree in co-relation 18317. Up to 4331 conditions per place. [2024-05-12 13:41:16,956 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 116 selfloop transitions, 36 changer transitions 0/161 dead transitions. [2024-05-12 13:41:16,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1705 flow [2024-05-12 13:41:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-05-12 13:41:16,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45592705167173253 [2024-05-12 13:41:16,958 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 1309 flow. Second operand 7 states and 150 transitions. [2024-05-12 13:41:16,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1705 flow [2024-05-12 13:41:16,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 161 transitions, 1638 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:16,983 INFO L231 Difference]: Finished difference. Result has 129 places, 152 transitions, 1375 flow [2024-05-12 13:41:16,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1375, PETRI_PLACES=129, PETRI_TRANSITIONS=152} [2024-05-12 13:41:16,984 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 76 predicate places. [2024-05-12 13:41:16,984 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 152 transitions, 1375 flow [2024-05-12 13:41:16,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:16,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:16,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 13:41:16,985 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:16,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash -131379372, now seen corresponding path program 5 times [2024-05-12 13:41:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:16,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683509645] [2024-05-12 13:41:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683509645] [2024-05-12 13:41:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683509645] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731570343] [2024-05-12 13:41:18,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:18,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:18,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:18,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:18,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 152 transitions, 1375 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:18,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:18,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:18,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:19,776 INFO L124 PetriNetUnfolderBase]: 3057/4932 cut-off events. [2024-05-12 13:41:19,776 INFO L125 PetriNetUnfolderBase]: For 25491/25640 co-relation queries the response was YES. [2024-05-12 13:41:19,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19245 conditions, 4932 events. 3057/4932 cut-off events. For 25491/25640 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29574 event pairs, 1097 based on Foata normal form. 4/4785 useless extension candidates. Maximal degree in co-relation 19187. Up to 4290 conditions per place. [2024-05-12 13:41:19,813 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 144 selfloop transitions, 43 changer transitions 0/196 dead transitions. [2024-05-12 13:41:19,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 196 transitions, 2177 flow [2024-05-12 13:41:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-05-12 13:41:19,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026595744680851 [2024-05-12 13:41:19,815 INFO L175 Difference]: Start difference. First operand has 129 places, 152 transitions, 1375 flow. Second operand 8 states and 189 transitions. [2024-05-12 13:41:19,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 196 transitions, 2177 flow [2024-05-12 13:41:19,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 196 transitions, 2030 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-05-12 13:41:19,898 INFO L231 Difference]: Finished difference. Result has 134 places, 164 transitions, 1542 flow [2024-05-12 13:41:19,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1542, PETRI_PLACES=134, PETRI_TRANSITIONS=164} [2024-05-12 13:41:19,899 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2024-05-12 13:41:19,899 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 164 transitions, 1542 flow [2024-05-12 13:41:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:19,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:19,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:19,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 13:41:19,900 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:19,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:19,901 INFO L85 PathProgramCache]: Analyzing trace with hash -132570702, now seen corresponding path program 6 times [2024-05-12 13:41:19,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:19,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607081718] [2024-05-12 13:41:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:19,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607081718] [2024-05-12 13:41:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607081718] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735974729] [2024-05-12 13:41:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:21,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:21,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:21,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 164 transitions, 1542 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:21,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:21,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:21,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:22,961 INFO L124 PetriNetUnfolderBase]: 3061/4937 cut-off events. [2024-05-12 13:41:22,961 INFO L125 PetriNetUnfolderBase]: For 33805/33956 co-relation queries the response was YES. [2024-05-12 13:41:22,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20847 conditions, 4937 events. 3061/4937 cut-off events. For 33805/33956 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29543 event pairs, 1100 based on Foata normal form. 5/4791 useless extension candidates. Maximal degree in co-relation 20786. Up to 4291 conditions per place. [2024-05-12 13:41:23,003 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 127 selfloop transitions, 59 changer transitions 0/195 dead transitions. [2024-05-12 13:41:23,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 195 transitions, 2214 flow [2024-05-12 13:41:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:41:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:41:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-05-12 13:41:23,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-05-12 13:41:23,006 INFO L175 Difference]: Start difference. First operand has 134 places, 164 transitions, 1542 flow. Second operand 9 states and 198 transitions. [2024-05-12 13:41:23,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 195 transitions, 2214 flow [2024-05-12 13:41:23,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 195 transitions, 2054 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:23,041 INFO L231 Difference]: Finished difference. Result has 141 places, 171 transitions, 1642 flow [2024-05-12 13:41:23,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1642, PETRI_PLACES=141, PETRI_TRANSITIONS=171} [2024-05-12 13:41:23,042 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 88 predicate places. [2024-05-12 13:41:23,042 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 171 transitions, 1642 flow [2024-05-12 13:41:23,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:23,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:23,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:23,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 13:41:23,043 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:23,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -176353552, now seen corresponding path program 1 times [2024-05-12 13:41:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:23,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027048792] [2024-05-12 13:41:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027048792] [2024-05-12 13:41:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027048792] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800564135] [2024-05-12 13:41:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:24,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:24,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:24,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 171 transitions, 1642 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:24,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:24,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:24,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:25,773 INFO L124 PetriNetUnfolderBase]: 3064/4952 cut-off events. [2024-05-12 13:41:25,774 INFO L125 PetriNetUnfolderBase]: For 39171/39311 co-relation queries the response was YES. [2024-05-12 13:41:25,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21733 conditions, 4952 events. 3064/4952 cut-off events. For 39171/39311 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29630 event pairs, 1290 based on Foata normal form. 6/4808 useless extension candidates. Maximal degree in co-relation 21669. Up to 4422 conditions per place. [2024-05-12 13:41:25,812 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 150 selfloop transitions, 20 changer transitions 0/179 dead transitions. [2024-05-12 13:41:25,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 179 transitions, 2048 flow [2024-05-12 13:41:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-05-12 13:41:25,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44376899696048633 [2024-05-12 13:41:25,813 INFO L175 Difference]: Start difference. First operand has 141 places, 171 transitions, 1642 flow. Second operand 7 states and 146 transitions. [2024-05-12 13:41:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 179 transitions, 2048 flow [2024-05-12 13:41:25,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 179 transitions, 1883 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-05-12 13:41:25,851 INFO L231 Difference]: Finished difference. Result has 143 places, 173 transitions, 1567 flow [2024-05-12 13:41:25,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1567, PETRI_PLACES=143, PETRI_TRANSITIONS=173} [2024-05-12 13:41:25,852 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 90 predicate places. [2024-05-12 13:41:25,852 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 173 transitions, 1567 flow [2024-05-12 13:41:25,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:25,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:25,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:25,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 13:41:25,853 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:25,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash -132560782, now seen corresponding path program 2 times [2024-05-12 13:41:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420664171] [2024-05-12 13:41:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420664171] [2024-05-12 13:41:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420664171] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:41:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745220295] [2024-05-12 13:41:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:27,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:41:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:27,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:41:27,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:41:27,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:27,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 173 transitions, 1567 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:27,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:27,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:27,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:28,974 INFO L124 PetriNetUnfolderBase]: 3067/4962 cut-off events. [2024-05-12 13:41:28,974 INFO L125 PetriNetUnfolderBase]: For 40526/40659 co-relation queries the response was YES. [2024-05-12 13:41:28,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21873 conditions, 4962 events. 3067/4962 cut-off events. For 40526/40659 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29756 event pairs, 1263 based on Foata normal form. 2/4814 useless extension candidates. Maximal degree in co-relation 21808. Up to 4411 conditions per place. [2024-05-12 13:41:29,005 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 152 selfloop transitions, 26 changer transitions 0/187 dead transitions. [2024-05-12 13:41:29,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 187 transitions, 2009 flow [2024-05-12 13:41:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-05-12 13:41:29,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45478723404255317 [2024-05-12 13:41:29,007 INFO L175 Difference]: Start difference. First operand has 143 places, 173 transitions, 1567 flow. Second operand 8 states and 171 transitions. [2024-05-12 13:41:29,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 187 transitions, 2009 flow [2024-05-12 13:41:29,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 187 transitions, 1934 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-05-12 13:41:29,038 INFO L231 Difference]: Finished difference. Result has 146 places, 175 transitions, 1599 flow [2024-05-12 13:41:29,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1599, PETRI_PLACES=146, PETRI_TRANSITIONS=175} [2024-05-12 13:41:29,039 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 93 predicate places. [2024-05-12 13:41:29,039 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 175 transitions, 1599 flow [2024-05-12 13:41:29,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:29,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:29,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:29,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 13:41:29,040 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:29,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash -131071852, now seen corresponding path program 3 times [2024-05-12 13:41:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303973021] [2024-05-12 13:41:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303973021] [2024-05-12 13:41:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303973021] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:41:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958465372] [2024-05-12 13:41:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:31,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:41:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:41:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:41:31,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:31,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 175 transitions, 1599 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:31,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:31,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:33,218 INFO L124 PetriNetUnfolderBase]: 3078/4977 cut-off events. [2024-05-12 13:41:33,218 INFO L125 PetriNetUnfolderBase]: For 42415/42549 co-relation queries the response was YES. [2024-05-12 13:41:33,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22259 conditions, 4977 events. 3078/4977 cut-off events. For 42415/42549 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29851 event pairs, 1211 based on Foata normal form. 3/4830 useless extension candidates. Maximal degree in co-relation 22193. Up to 4362 conditions per place. [2024-05-12 13:41:33,257 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 165 selfloop transitions, 39 changer transitions 0/213 dead transitions. [2024-05-12 13:41:33,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 213 transitions, 2318 flow [2024-05-12 13:41:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:41:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:41:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-05-12 13:41:33,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48226950354609927 [2024-05-12 13:41:33,259 INFO L175 Difference]: Start difference. First operand has 146 places, 175 transitions, 1599 flow. Second operand 9 states and 204 transitions. [2024-05-12 13:41:33,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 213 transitions, 2318 flow [2024-05-12 13:41:33,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 213 transitions, 2227 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-05-12 13:41:33,303 INFO L231 Difference]: Finished difference. Result has 151 places, 186 transitions, 1783 flow [2024-05-12 13:41:33,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1783, PETRI_PLACES=151, PETRI_TRANSITIONS=186} [2024-05-12 13:41:33,303 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 98 predicate places. [2024-05-12 13:41:33,303 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 186 transitions, 1783 flow [2024-05-12 13:41:33,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:33,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:33,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:33,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 13:41:33,304 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:33,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -131119282, now seen corresponding path program 4 times [2024-05-12 13:41:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474281195] [2024-05-12 13:41:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:33,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474281195] [2024-05-12 13:41:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474281195] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:41:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618446753] [2024-05-12 13:41:35,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:35,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:41:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:35,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:41:35,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:41:35,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:35,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 186 transitions, 1783 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:35,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:35,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:35,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:36,822 INFO L124 PetriNetUnfolderBase]: 3075/4971 cut-off events. [2024-05-12 13:41:36,822 INFO L125 PetriNetUnfolderBase]: For 45603/45739 co-relation queries the response was YES. [2024-05-12 13:41:36,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22859 conditions, 4971 events. 3075/4971 cut-off events. For 45603/45739 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 29833 event pairs, 1256 based on Foata normal form. 3/4824 useless extension candidates. Maximal degree in co-relation 22790. Up to 4400 conditions per place. [2024-05-12 13:41:36,856 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 152 selfloop transitions, 45 changer transitions 0/206 dead transitions. [2024-05-12 13:41:36,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 206 transitions, 2292 flow [2024-05-12 13:41:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-05-12 13:41:36,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48138297872340424 [2024-05-12 13:41:36,858 INFO L175 Difference]: Start difference. First operand has 151 places, 186 transitions, 1783 flow. Second operand 8 states and 181 transitions. [2024-05-12 13:41:36,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 206 transitions, 2292 flow [2024-05-12 13:41:36,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 206 transitions, 2196 flow, removed 42 selfloop flow, removed 2 redundant places. [2024-05-12 13:41:36,906 INFO L231 Difference]: Finished difference. Result has 157 places, 188 transitions, 1839 flow [2024-05-12 13:41:36,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1839, PETRI_PLACES=157, PETRI_TRANSITIONS=188} [2024-05-12 13:41:36,906 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 104 predicate places. [2024-05-12 13:41:36,906 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 188 transitions, 1839 flow [2024-05-12 13:41:36,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:36,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:36,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:36,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 13:41:36,907 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:36,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 561555063, now seen corresponding path program 1 times [2024-05-12 13:41:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097257027] [2024-05-12 13:41:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097257027] [2024-05-12 13:41:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097257027] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536126153] [2024-05-12 13:41:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:38,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:38,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:38,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 188 transitions, 1839 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:38,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:38,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:38,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:40,003 INFO L124 PetriNetUnfolderBase]: 3436/5471 cut-off events. [2024-05-12 13:41:40,003 INFO L125 PetriNetUnfolderBase]: For 48335/48454 co-relation queries the response was YES. [2024-05-12 13:41:40,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25033 conditions, 5471 events. 3436/5471 cut-off events. For 48335/48454 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32734 event pairs, 1492 based on Foata normal form. 1/5165 useless extension candidates. Maximal degree in co-relation 24961. Up to 4886 conditions per place. [2024-05-12 13:41:40,057 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 157 selfloop transitions, 41 changer transitions 0/207 dead transitions. [2024-05-12 13:41:40,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 207 transitions, 2367 flow [2024-05-12 13:41:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:41:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:41:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-05-12 13:41:40,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212765957446809 [2024-05-12 13:41:40,060 INFO L175 Difference]: Start difference. First operand has 157 places, 188 transitions, 1839 flow. Second operand 6 states and 147 transitions. [2024-05-12 13:41:40,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 207 transitions, 2367 flow [2024-05-12 13:41:40,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 207 transitions, 2236 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-05-12 13:41:40,127 INFO L231 Difference]: Finished difference. Result has 158 places, 195 transitions, 1907 flow [2024-05-12 13:41:40,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1708, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=158, PETRI_TRANSITIONS=195} [2024-05-12 13:41:40,129 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 105 predicate places. [2024-05-12 13:41:40,129 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 195 transitions, 1907 flow [2024-05-12 13:41:40,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:40,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:40,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:40,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 13:41:40,130 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:40,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash -248550376, now seen corresponding path program 1 times [2024-05-12 13:41:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:40,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588422333] [2024-05-12 13:41:40,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:40,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588422333] [2024-05-12 13:41:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588422333] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:42,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:41:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752021541] [2024-05-12 13:41:42,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:42,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:41:42,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:41:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:41:42,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:42,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 195 transitions, 1907 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:42,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:42,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:42,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:44,083 INFO L124 PetriNetUnfolderBase]: 3133/5058 cut-off events. [2024-05-12 13:41:44,083 INFO L125 PetriNetUnfolderBase]: For 49073/49451 co-relation queries the response was YES. [2024-05-12 13:41:44,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23892 conditions, 5058 events. 3133/5058 cut-off events. For 49073/49451 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 30231 event pairs, 1221 based on Foata normal form. 3/4911 useless extension candidates. Maximal degree in co-relation 23818. Up to 4413 conditions per place. [2024-05-12 13:41:44,130 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 178 selfloop transitions, 51 changer transitions 0/238 dead transitions. [2024-05-12 13:41:44,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 238 transitions, 2867 flow [2024-05-12 13:41:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:41:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:41:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 213 transitions. [2024-05-12 13:41:44,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-05-12 13:41:44,132 INFO L175 Difference]: Start difference. First operand has 158 places, 195 transitions, 1907 flow. Second operand 9 states and 213 transitions. [2024-05-12 13:41:44,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 238 transitions, 2867 flow [2024-05-12 13:41:44,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 238 transitions, 2806 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:44,194 INFO L231 Difference]: Finished difference. Result has 165 places, 207 transitions, 2189 flow [2024-05-12 13:41:44,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2189, PETRI_PLACES=165, PETRI_TRANSITIONS=207} [2024-05-12 13:41:44,195 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 112 predicate places. [2024-05-12 13:41:44,195 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 207 transitions, 2189 flow [2024-05-12 13:41:44,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:44,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:44,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:44,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 13:41:44,196 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:44,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 561137493, now seen corresponding path program 2 times [2024-05-12 13:41:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209012802] [2024-05-12 13:41:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209012802] [2024-05-12 13:41:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209012802] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:45,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:45,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:45,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724349823] [2024-05-12 13:41:45,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:45,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:45,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:45,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:45,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:45,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 207 transitions, 2189 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:45,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:45,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:45,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:47,147 INFO L124 PetriNetUnfolderBase]: 3488/5541 cut-off events. [2024-05-12 13:41:47,147 INFO L125 PetriNetUnfolderBase]: For 63492/63617 co-relation queries the response was YES. [2024-05-12 13:41:47,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27779 conditions, 5541 events. 3488/5541 cut-off events. For 63492/63617 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33140 event pairs, 1453 based on Foata normal form. 1/5236 useless extension candidates. Maximal degree in co-relation 27703. Up to 4960 conditions per place. [2024-05-12 13:41:47,188 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 167 selfloop transitions, 44 changer transitions 0/220 dead transitions. [2024-05-12 13:41:47,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 220 transitions, 2755 flow [2024-05-12 13:41:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:41:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:41:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-05-12 13:41:47,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858156028368794 [2024-05-12 13:41:47,190 INFO L175 Difference]: Start difference. First operand has 165 places, 207 transitions, 2189 flow. Second operand 6 states and 137 transitions. [2024-05-12 13:41:47,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 220 transitions, 2755 flow [2024-05-12 13:41:47,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 220 transitions, 2579 flow, removed 63 selfloop flow, removed 5 redundant places. [2024-05-12 13:41:47,259 INFO L231 Difference]: Finished difference. Result has 166 places, 213 transitions, 2204 flow [2024-05-12 13:41:47,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2204, PETRI_PLACES=166, PETRI_TRANSITIONS=213} [2024-05-12 13:41:47,263 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 113 predicate places. [2024-05-12 13:41:47,264 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 213 transitions, 2204 flow [2024-05-12 13:41:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:47,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:47,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 13:41:47,264 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:47,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 222255170, now seen corresponding path program 2 times [2024-05-12 13:41:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637636924] [2024-05-12 13:41:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637636924] [2024-05-12 13:41:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637636924] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:49,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:49,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:41:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578889107] [2024-05-12 13:41:49,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:49,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:41:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:49,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:41:49,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:41:49,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:49,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 213 transitions, 2204 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:49,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:49,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:49,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:50,919 INFO L124 PetriNetUnfolderBase]: 3164/5103 cut-off events. [2024-05-12 13:41:50,920 INFO L125 PetriNetUnfolderBase]: For 61146/61847 co-relation queries the response was YES. [2024-05-12 13:41:50,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25753 conditions, 5103 events. 3164/5103 cut-off events. For 61146/61847 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 30517 event pairs, 1130 based on Foata normal form. 2/4954 useless extension candidates. Maximal degree in co-relation 25675. Up to 4455 conditions per place. [2024-05-12 13:41:50,967 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 200 selfloop transitions, 72 changer transitions 0/281 dead transitions. [2024-05-12 13:41:50,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 281 transitions, 3373 flow [2024-05-12 13:41:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-05-12 13:41:50,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 13:41:50,969 INFO L175 Difference]: Start difference. First operand has 166 places, 213 transitions, 2204 flow. Second operand 8 states and 192 transitions. [2024-05-12 13:41:50,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 281 transitions, 3373 flow [2024-05-12 13:41:51,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 281 transitions, 3312 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:51,032 INFO L231 Difference]: Finished difference. Result has 174 places, 244 transitions, 2818 flow [2024-05-12 13:41:51,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2818, PETRI_PLACES=174, PETRI_TRANSITIONS=244} [2024-05-12 13:41:51,033 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2024-05-12 13:41:51,033 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 244 transitions, 2818 flow [2024-05-12 13:41:51,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:51,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:51,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:51,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 13:41:51,034 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:51,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -74945416, now seen corresponding path program 3 times [2024-05-12 13:41:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474941739] [2024-05-12 13:41:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:53,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474941739] [2024-05-12 13:41:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474941739] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:53,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:41:53,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858972735] [2024-05-12 13:41:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:53,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:41:53,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:53,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:41:53,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:41:53,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:53,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 244 transitions, 2818 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:53,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:53,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:53,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:55,156 INFO L124 PetriNetUnfolderBase]: 3202/5152 cut-off events. [2024-05-12 13:41:55,156 INFO L125 PetriNetUnfolderBase]: For 72553/73229 co-relation queries the response was YES. [2024-05-12 13:41:55,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27702 conditions, 5152 events. 3202/5152 cut-off events. For 72553/73229 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 30842 event pairs, 1135 based on Foata normal form. 2/5003 useless extension candidates. Maximal degree in co-relation 27619. Up to 4360 conditions per place. [2024-05-12 13:41:55,202 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 163 selfloop transitions, 122 changer transitions 0/294 dead transitions. [2024-05-12 13:41:55,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 294 transitions, 4256 flow [2024-05-12 13:41:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 13:41:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 13:41:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-05-12 13:41:55,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2024-05-12 13:41:55,204 INFO L175 Difference]: Start difference. First operand has 174 places, 244 transitions, 2818 flow. Second operand 10 states and 226 transitions. [2024-05-12 13:41:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 294 transitions, 4256 flow [2024-05-12 13:41:55,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 294 transitions, 3835 flow, removed 185 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:55,338 INFO L231 Difference]: Finished difference. Result has 183 places, 261 transitions, 3229 flow [2024-05-12 13:41:55,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2525, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3229, PETRI_PLACES=183, PETRI_TRANSITIONS=261} [2024-05-12 13:41:55,340 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 130 predicate places. [2024-05-12 13:41:55,340 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 261 transitions, 3229 flow [2024-05-12 13:41:55,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:55,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:55,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:55,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 13:41:55,341 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:55,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 231451940, now seen corresponding path program 4 times [2024-05-12 13:41:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936432398] [2024-05-12 13:41:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:57,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-05-12 13:41:57,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936432398] [2024-05-12 13:41:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936432398] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 13:41:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420377116] [2024-05-12 13:41:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:57,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 13:41:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 13:41:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 13:41:57,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:57,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 261 transitions, 3229 flow. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:57,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:57,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:57,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:58,875 INFO L124 PetriNetUnfolderBase]: 3203/5158 cut-off events. [2024-05-12 13:41:58,875 INFO L125 PetriNetUnfolderBase]: For 77219/77915 co-relation queries the response was YES. [2024-05-12 13:41:58,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28434 conditions, 5158 events. 3203/5158 cut-off events. For 77219/77915 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 30850 event pairs, 1133 based on Foata normal form. 2/5009 useless extension candidates. Maximal degree in co-relation 28348. Up to 4442 conditions per place. [2024-05-12 13:41:58,931 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 195 selfloop transitions, 118 changer transitions 0/322 dead transitions. [2024-05-12 13:41:58,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 322 transitions, 4549 flow [2024-05-12 13:41:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 13:41:58,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132978723404256 [2024-05-12 13:41:58,933 INFO L175 Difference]: Start difference. First operand has 183 places, 261 transitions, 3229 flow. Second operand 8 states and 193 transitions. [2024-05-12 13:41:58,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 322 transitions, 4549 flow [2024-05-12 13:41:59,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 322 transitions, 4297 flow, removed 84 selfloop flow, removed 5 redundant places. [2024-05-12 13:41:59,106 INFO L231 Difference]: Finished difference. Result has 188 places, 281 transitions, 3768 flow [2024-05-12 13:41:59,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3768, PETRI_PLACES=188, PETRI_TRANSITIONS=281} [2024-05-12 13:41:59,107 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 135 predicate places. [2024-05-12 13:41:59,107 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 281 transitions, 3768 flow [2024-05-12 13:41:59,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:59,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:59,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:59,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 13:41:59,108 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:41:59,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 550152798, now seen corresponding path program 1 times [2024-05-12 13:41:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:59,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963161942] [2024-05-12 13:41:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:00,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963161942] [2024-05-12 13:42:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963161942] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:00,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607339510] [2024-05-12 13:42:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:00,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:00,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:00,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 281 transitions, 3768 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:00,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:00,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:00,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:02,119 INFO L124 PetriNetUnfolderBase]: 3569/5664 cut-off events. [2024-05-12 13:42:02,120 INFO L125 PetriNetUnfolderBase]: For 83322/83458 co-relation queries the response was YES. [2024-05-12 13:42:02,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31771 conditions, 5664 events. 3569/5664 cut-off events. For 83322/83458 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33859 event pairs, 1425 based on Foata normal form. 1/5356 useless extension candidates. Maximal degree in co-relation 31681. Up to 5107 conditions per place. [2024-05-12 13:42:02,169 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 263 selfloop transitions, 29 changer transitions 0/301 dead transitions. [2024-05-12 13:42:02,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 301 transitions, 4524 flow [2024-05-12 13:42:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-05-12 13:42:02,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48328267477203646 [2024-05-12 13:42:02,172 INFO L175 Difference]: Start difference. First operand has 188 places, 281 transitions, 3768 flow. Second operand 7 states and 159 transitions. [2024-05-12 13:42:02,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 301 transitions, 4524 flow [2024-05-12 13:42:02,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 4221 flow, removed 118 selfloop flow, removed 3 redundant places. [2024-05-12 13:42:02,357 INFO L231 Difference]: Finished difference. Result has 194 places, 290 transitions, 3687 flow [2024-05-12 13:42:02,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3467, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3687, PETRI_PLACES=194, PETRI_TRANSITIONS=290} [2024-05-12 13:42:02,358 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 141 predicate places. [2024-05-12 13:42:02,358 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 290 transitions, 3687 flow [2024-05-12 13:42:02,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:02,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:02,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:02,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 13:42:02,359 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:42:02,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1201269742, now seen corresponding path program 2 times [2024-05-12 13:42:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:02,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701508332] [2024-05-12 13:42:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701508332] [2024-05-12 13:42:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701508332] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:03,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733749205] [2024-05-12 13:42:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:03,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:03,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:03,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 290 transitions, 3687 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:03,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:03,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:03,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:05,191 INFO L124 PetriNetUnfolderBase]: 3569/5662 cut-off events. [2024-05-12 13:42:05,192 INFO L125 PetriNetUnfolderBase]: For 83582/83718 co-relation queries the response was YES. [2024-05-12 13:42:05,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32404 conditions, 5662 events. 3569/5662 cut-off events. For 83582/83718 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 33790 event pairs, 1450 based on Foata normal form. 1/5356 useless extension candidates. Maximal degree in co-relation 32310. Up to 5125 conditions per place. [2024-05-12 13:42:05,250 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 271 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2024-05-12 13:42:05,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 301 transitions, 4412 flow [2024-05-12 13:42:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:42:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:42:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-05-12 13:42:05,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-05-12 13:42:05,252 INFO L175 Difference]: Start difference. First operand has 194 places, 290 transitions, 3687 flow. Second operand 6 states and 132 transitions. [2024-05-12 13:42:05,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 301 transitions, 4412 flow [2024-05-12 13:42:05,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 301 transitions, 4347 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-05-12 13:42:05,423 INFO L231 Difference]: Finished difference. Result has 197 places, 296 transitions, 3792 flow [2024-05-12 13:42:05,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3792, PETRI_PLACES=197, PETRI_TRANSITIONS=296} [2024-05-12 13:42:05,424 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 144 predicate places. [2024-05-12 13:42:05,424 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 296 transitions, 3792 flow [2024-05-12 13:42:05,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:05,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:05,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:05,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 13:42:05,425 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 13:42:05,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 561150389, now seen corresponding path program 1 times [2024-05-12 13:42:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741451215] [2024-05-12 13:42:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:42:05,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:42:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:42:05,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:42:05,518 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:42:05,519 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 9 remaining) [2024-05-12 13:42:05,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-05-12 13:42:05,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 9 remaining) [2024-05-12 13:42:05,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-05-12 13:42:05,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2024-05-12 13:42:05,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-05-12 13:42:05,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-05-12 13:42:05,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-05-12 13:42:05,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-05-12 13:42:05,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 13:42:05,521 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:05,525 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:42:05,525 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:42:05,558 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,558 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,558 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,559 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,559 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,559 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,559 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,559 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,560 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,561 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,564 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,564 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,564 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,564 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,565 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:05,567 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-05-12 13:42:05,576 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-05-12 13:42:05,580 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-05-12 13:42:05,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:42:05 BasicIcfg [2024-05-12 13:42:05,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:42:05,581 INFO L158 Benchmark]: Toolchain (without parser) took 102322.87ms. Allocated memory was 195.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 157.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 816.2MB. Max. memory is 16.1GB. [2024-05-12 13:42:05,582 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 91.4MB in the beginning and 91.4MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:42:05,582 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:42:05,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.06ms. Allocated memory is still 195.0MB. Free memory was 157.6MB in the beginning and 107.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-05-12 13:42:05,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.40ms. Allocated memory is still 195.0MB. Free memory was 107.3MB in the beginning and 104.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:42:05,582 INFO L158 Benchmark]: Boogie Preprocessor took 84.87ms. Allocated memory is still 195.0MB. Free memory was 104.1MB in the beginning and 98.1MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-05-12 13:42:05,583 INFO L158 Benchmark]: RCFGBuilder took 1084.94ms. Allocated memory is still 195.0MB. Free memory was 98.1MB in the beginning and 86.4MB in the end (delta: 11.7MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-05-12 13:42:05,583 INFO L158 Benchmark]: TraceAbstraction took 100396.65ms. Allocated memory was 195.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 85.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 744.0MB. Max. memory is 16.1GB. [2024-05-12 13:42:05,584 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 91.4MB in the beginning and 91.4MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.06ms. Allocated memory is still 195.0MB. Free memory was 157.6MB in the beginning and 107.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.40ms. Allocated memory is still 195.0MB. Free memory was 107.3MB in the beginning and 104.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.87ms. Allocated memory is still 195.0MB. Free memory was 104.1MB in the beginning and 98.1MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1084.94ms. Allocated memory is still 195.0MB. Free memory was 98.1MB in the beginning and 86.4MB in the end (delta: 11.7MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 100396.65ms. Allocated memory was 195.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 85.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 744.0MB. 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: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 865]: 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; [L859] 0 pthread_t t2257; 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, t2257={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L860] 0 //@ ghost multithreaded = 1; [L860] FCALL, FORK 0 pthread_create(&t2257, ((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, t2257={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2258; [L862] 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 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!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 <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!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 <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!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 <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!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 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] FCALL, FORK 0 pthread_create(&t2258, ((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, t2257={6:0}, t2258={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 x [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L862] 0 __unbuffered_p2_EAX$read_delayed_var [L863] 0 pthread_t t2259; [L864] 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 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!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 <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!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 <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!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 <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!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 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] FCALL, FORK 0 pthread_create(&t2259, ((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, t2257={6:0}, t2258={7:0}, t2259={5: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] [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 x [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L864] 0 __unbuffered_p2_EAX$read_delayed_var [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] 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)))) [L820] EXPR 3 \read(x) [L820] 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)))) [L820] 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)))) [L821] 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)))) [L822] 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)))) [L823] 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)))) [L824] 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)))) [L825] 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)))) [L826] 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)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 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] [L865] 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 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!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 <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!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 <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!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 <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!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 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!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, t2257={6:0}, t2258={7:0}, t2259={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 100.2s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1648 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1436 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8714 IncrementalHoareTripleChecker+Invalid, 8875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 74 mSDtfsCounter, 8714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3792occurred in iteration=33, InterpolantAutomatonStates: 225, 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.5s SatisfiabilityAnalysisTime, 53.9s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 41818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 13:42:05,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE