./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe019_power.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe019_power.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 20:12:06,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:12:06,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:12:06,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:12:06,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:12:06,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:12:06,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:12:06,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:12:06,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:12:06,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:12:06,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:12:06,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:12:06,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:12:06,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:12:06,222 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:12:06,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:12:06,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:12:06,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:12:06,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:12:06,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:12:06,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:12:06,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:12:06,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:12:06,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:12:06,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:12:06,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:12:06,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:12:06,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:12:06,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:12:06,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:12:06,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:12:06,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:12:06,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:12:06,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:12:06,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:12:06,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:12:06,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:12:06,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:12:06,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:12:06,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:12:06,230 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:12:06,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:12:06,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:12:06,230 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 20:12:06,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:12:06,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:12:06,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:12:06,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:12:06,519 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:12:06,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2024-06-03 20:12:07,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:12:07,959 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:12:07,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2024-06-03 20:12:07,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e4c0ca1/7df60c0c299a4c5685bcb8b29862fc63/FLAG4e9bf356f [2024-06-03 20:12:07,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e4c0ca1/7df60c0c299a4c5685bcb8b29862fc63 [2024-06-03 20:12:07,997 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:12:07,997 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:12:07,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe019_power.opt.yml/witness.yml [2024-06-03 20:12:08,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:12:08,236 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:12:08,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:12:08,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:12:08,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:12:08,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:12:07" (1/2) ... [2024-06-03 20:12:08,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a510ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:12:08, skipping insertion in model container [2024-06-03 20:12:08,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:12:07" (1/2) ... [2024-06-03 20:12:08,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b94c83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:12:08, skipping insertion in model container [2024-06-03 20:12:08,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:12:08" (2/2) ... [2024-06-03 20:12:08,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a510ece and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:08, skipping insertion in model container [2024-06-03 20:12:08,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:12:08" (2/2) ... [2024-06-03 20:12:08,248 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:12:08,534 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:12:08,535 INFO L97 edCorrectnessWitness]: Location invariant before [L885-L885] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_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_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! 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 || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-06-03 20:12:08,535 INFO L97 edCorrectnessWitness]: Location invariant before [L887-L887] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_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_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! 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 || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-06-03 20:12:08,536 INFO L97 edCorrectnessWitness]: Location invariant before [L889-L889] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_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_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! 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 || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-06-03 20:12:08,536 INFO L97 edCorrectnessWitness]: Location invariant before [L890-L890] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd4 == (_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_used == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! 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 || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! 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 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-06-03 20:12:08,536 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:12:08,537 INFO L106 edCorrectnessWitness]: ghost_update [L883-L883] multithreaded = 1; [2024-06-03 20:12:08,579 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:12:08,951 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:12:08,962 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:12:09,150 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:12:09,192 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:12:09,193 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09 WrapperNode [2024-06-03 20:12:09,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:12:09,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:12:09,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:12:09,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:12:09,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,282 INFO L138 Inliner]: procedures = 176, calls = 105, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 285 [2024-06-03 20:12:09,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:12:09,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:12:09,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:12:09,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:12:09,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,318 INFO L175 MemorySlicer]: Split 58 memory accesses to 2 slices as follows [56, 2]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 8 writes are split as follows [8, 0]. [2024-06-03 20:12:09,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:12:09,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:12:09,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:12:09,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:12:09,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (1/1) ... [2024-06-03 20:12:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:12:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:12:09,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 20:12:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 20:12:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:12:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:12:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:12:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:12:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:12:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:12:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:12:09,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:12:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:12:09,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:12:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:12:09,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:12:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-03 20:12:09,418 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-03 20:12:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:12:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:12:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:12:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:12:09,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:12:09,421 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:12:09,607 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:12:09,609 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:12:10,264 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:12:10,265 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:12:10,850 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:12:10,851 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:12:10,851 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:12:10 BoogieIcfgContainer [2024-06-03 20:12:10,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:12:10,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:12:10,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:12:10,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:12:10,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:12:07" (1/4) ... [2024-06-03 20:12:10,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d04ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:12:10, skipping insertion in model container [2024-06-03 20:12:10,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:12:08" (2/4) ... [2024-06-03 20:12:10,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d04ff0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:12:10, skipping insertion in model container [2024-06-03 20:12:10,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:09" (3/4) ... [2024-06-03 20:12:10,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d04ff0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:12:10, skipping insertion in model container [2024-06-03 20:12:10,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:12:10" (4/4) ... [2024-06-03 20:12:10,861 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2024-06-03 20:12:10,878 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:12:10,879 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-03 20:12:10,879 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:12:10,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:12:11,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 116 flow [2024-06-03 20:12:11,045 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2024-06-03 20:12:11,046 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:12:11,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:12:11,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 50 transitions, 116 flow [2024-06-03 20:12:11,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 40 transitions, 92 flow [2024-06-03 20:12:11,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:12:11,076 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;@ac98337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:12:11,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-03 20:12:11,091 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:12:11,092 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 20:12:11,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:12:11,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:11,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:12:11,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:11,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash 411570758, now seen corresponding path program 1 times [2024-06-03 20:12:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687514426] [2024-06-03 20:12:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687514426] [2024-06-03 20:12:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687514426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:12:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89266926] [2024-06-03 20:12:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:13,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:12:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:12:13,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:12:13,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:13,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 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-06-03 20:12:13,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:13,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:13,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:15,317 INFO L124 PetriNetUnfolderBase]: 4182/5835 cut-off events. [2024-06-03 20:12:15,317 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-06-03 20:12:15,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11950 conditions, 5835 events. 4182/5835 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29057 event pairs, 2366 based on Foata normal form. 0/5828 useless extension candidates. Maximal degree in co-relation 11934. Up to 5785 conditions per place. [2024-06-03 20:12:15,353 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 40 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-06-03 20:12:15,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 231 flow [2024-06-03 20:12:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:12:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:12:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-03 20:12:15,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2024-06-03 20:12:15,366 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 4 states and 101 transitions. [2024-06-03 20:12:15,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 231 flow [2024-06-03 20:12:15,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-03 20:12:15,372 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 142 flow [2024-06-03 20:12:15,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2024-06-03 20:12:15,377 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-06-03 20:12:15,377 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 142 flow [2024-06-03 20:12:15,377 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-06-03 20:12:15,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:15,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:15,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:12:15,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:15,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1026105450, now seen corresponding path program 1 times [2024-06-03 20:12:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:15,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199303567] [2024-06-03 20:12:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:15,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:17,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:17,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199303567] [2024-06-03 20:12:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199303567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:12:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291192615] [2024-06-03 20:12:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:17,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:12:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:17,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:12:17,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:12:17,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:17,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 142 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-06-03 20:12:17,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:17,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:17,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:19,496 INFO L124 PetriNetUnfolderBase]: 4208/5875 cut-off events. [2024-06-03 20:12:19,497 INFO L125 PetriNetUnfolderBase]: For 1059/1061 co-relation queries the response was YES. [2024-06-03 20:12:19,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13324 conditions, 5875 events. 4208/5875 cut-off events. For 1059/1061 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29549 event pairs, 2395 based on Foata normal form. 0/5853 useless extension candidates. Maximal degree in co-relation 13308. Up to 5827 conditions per place. [2024-06-03 20:12:19,530 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 39 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2024-06-03 20:12:19,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 278 flow [2024-06-03 20:12:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-03 20:12:19,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-03 20:12:19,536 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 142 flow. Second operand 5 states and 115 transitions. [2024-06-03 20:12:19,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 278 flow [2024-06-03 20:12:19,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:12:19,542 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 196 flow [2024-06-03 20:12:19,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-03 20:12:19,543 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-06-03 20:12:19,543 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 196 flow [2024-06-03 20:12:19,548 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-06-03 20:12:19,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:19,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:19,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:12:19,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:19,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash -588704124, now seen corresponding path program 1 times [2024-06-03 20:12:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547400504] [2024-06-03 20:12:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:23,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-06-03 20:12:23,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547400504] [2024-06-03 20:12:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547400504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667928064] [2024-06-03 20:12:23,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:23,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:23,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:23,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:12:23,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:23,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:23,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:12:23,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:24,871 INFO L124 PetriNetUnfolderBase]: 5330/7400 cut-off events. [2024-06-03 20:12:24,871 INFO L125 PetriNetUnfolderBase]: For 1368/1384 co-relation queries the response was YES. [2024-06-03 20:12:24,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16836 conditions, 7400 events. 5330/7400 cut-off events. For 1368/1384 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36391 event pairs, 2786 based on Foata normal form. 0/7394 useless extension candidates. Maximal degree in co-relation 16815. Up to 7320 conditions per place. [2024-06-03 20:12:24,922 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 44 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2024-06-03 20:12:24,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 338 flow [2024-06-03 20:12:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-03 20:12:24,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.456 [2024-06-03 20:12:24,927 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 196 flow. Second operand 5 states and 114 transitions. [2024-06-03 20:12:24,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 338 flow [2024-06-03 20:12:24,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:12:24,931 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 218 flow [2024-06-03 20:12:24,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-06-03 20:12:24,932 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2024-06-03 20:12:24,932 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 218 flow [2024-06-03 20:12:24,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:24,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:24,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:24,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:12:24,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:24,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1756691981, now seen corresponding path program 1 times [2024-06-03 20:12:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:24,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118658287] [2024-06-03 20:12:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:24,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118658287] [2024-06-03 20:12:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118658287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975293114] [2024-06-03 20:12:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:27,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:27,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 218 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-06-03 20:12:27,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:27,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:27,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:28,813 INFO L124 PetriNetUnfolderBase]: 4213/5888 cut-off events. [2024-06-03 20:12:28,813 INFO L125 PetriNetUnfolderBase]: For 1304/1304 co-relation queries the response was YES. [2024-06-03 20:12:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13511 conditions, 5888 events. 4213/5888 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29768 event pairs, 2233 based on Foata normal form. 0/5867 useless extension candidates. Maximal degree in co-relation 13489. Up to 5855 conditions per place. [2024-06-03 20:12:28,843 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 50 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2024-06-03 20:12:28,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 440 flow [2024-06-03 20:12:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-03 20:12:28,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 20:12:28,845 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 218 flow. Second operand 6 states and 130 transitions. [2024-06-03 20:12:28,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 440 flow [2024-06-03 20:12:28,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 406 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:28,848 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 309 flow [2024-06-03 20:12:28,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-03 20:12:28,849 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-06-03 20:12:28,850 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 309 flow [2024-06-03 20:12:28,850 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-06-03 20:12:28,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:28,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:28,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:12:28,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:28,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1756741271, now seen corresponding path program 2 times [2024-06-03 20:12:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:28,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095965307] [2024-06-03 20:12:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:31,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:31,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095965307] [2024-06-03 20:12:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095965307] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914231309] [2024-06-03 20:12:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:31,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:31,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:31,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 309 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-06-03 20:12:31,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:31,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:31,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:32,631 INFO L124 PetriNetUnfolderBase]: 4241/5935 cut-off events. [2024-06-03 20:12:32,631 INFO L125 PetriNetUnfolderBase]: For 1974/1980 co-relation queries the response was YES. [2024-06-03 20:12:32,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14434 conditions, 5935 events. 4241/5935 cut-off events. For 1974/1980 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29897 event pairs, 2152 based on Foata normal form. 2/5916 useless extension candidates. Maximal degree in co-relation 14408. Up to 5860 conditions per place. [2024-06-03 20:12:32,666 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 65 selfloop transitions, 20 changer transitions 0/94 dead transitions. [2024-06-03 20:12:32,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 603 flow [2024-06-03 20:12:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2024-06-03 20:12:32,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542857142857143 [2024-06-03 20:12:32,670 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 309 flow. Second operand 7 states and 159 transitions. [2024-06-03 20:12:32,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 603 flow [2024-06-03 20:12:32,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 94 transitions, 597 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-03 20:12:32,677 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 432 flow [2024-06-03 20:12:32,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2024-06-03 20:12:32,680 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2024-06-03 20:12:32,680 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 432 flow [2024-06-03 20:12:32,681 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-06-03 20:12:32,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:32,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:32,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:12:32,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:32,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash -588435354, now seen corresponding path program 2 times [2024-06-03 20:12:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164426636] [2024-06-03 20:12:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164426636] [2024-06-03 20:12:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164426636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:35,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:35,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321868011] [2024-06-03 20:12:35,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:35,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:35,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:35,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:35,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:12:35,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:35,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:35,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:12:35,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:37,148 INFO L124 PetriNetUnfolderBase]: 5376/7487 cut-off events. [2024-06-03 20:12:37,149 INFO L125 PetriNetUnfolderBase]: For 6499/6543 co-relation queries the response was YES. [2024-06-03 20:12:37,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20424 conditions, 7487 events. 5376/7487 cut-off events. For 6499/6543 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37101 event pairs, 1916 based on Foata normal form. 3/7482 useless extension candidates. Maximal degree in co-relation 20393. Up to 7343 conditions per place. [2024-06-03 20:12:37,195 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 68 selfloop transitions, 17 changer transitions 0/93 dead transitions. [2024-06-03 20:12:37,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 666 flow [2024-06-03 20:12:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-03 20:12:37,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484 [2024-06-03 20:12:37,197 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 432 flow. Second operand 5 states and 121 transitions. [2024-06-03 20:12:37,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 666 flow [2024-06-03 20:12:37,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 633 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-03 20:12:37,204 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 457 flow [2024-06-03 20:12:37,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2024-06-03 20:12:37,205 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-06-03 20:12:37,206 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 457 flow [2024-06-03 20:12:37,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:37,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:37,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:37,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:12:37,207 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:37,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1424147517, now seen corresponding path program 1 times [2024-06-03 20:12:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185310156] [2024-06-03 20:12:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185310156] [2024-06-03 20:12:39,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185310156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:39,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:12:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893897519] [2024-06-03 20:12:39,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:39,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:12:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:12:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:12:39,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:39,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 457 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-06-03 20:12:39,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:39,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:40,470 INFO L124 PetriNetUnfolderBase]: 4505/6311 cut-off events. [2024-06-03 20:12:40,470 INFO L125 PetriNetUnfolderBase]: For 7831/7880 co-relation queries the response was YES. [2024-06-03 20:12:40,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18410 conditions, 6311 events. 4505/6311 cut-off events. For 7831/7880 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 32486 event pairs, 2258 based on Foata normal form. 2/6186 useless extension candidates. Maximal degree in co-relation 18378. Up to 6246 conditions per place. [2024-06-03 20:12:40,503 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 61 selfloop transitions, 20 changer transitions 0/89 dead transitions. [2024-06-03 20:12:40,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 89 transitions, 702 flow [2024-06-03 20:12:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-03 20:12:40,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464 [2024-06-03 20:12:40,505 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 457 flow. Second operand 5 states and 116 transitions. [2024-06-03 20:12:40,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 89 transitions, 702 flow [2024-06-03 20:12:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 647 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:40,514 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 532 flow [2024-06-03 20:12:40,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2024-06-03 20:12:40,515 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2024-06-03 20:12:40,515 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 532 flow [2024-06-03 20:12:40,515 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-06-03 20:12:40,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:40,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:40,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:12:40,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:40,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:40,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1375543535, now seen corresponding path program 1 times [2024-06-03 20:12:40,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:40,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152829650] [2024-06-03 20:12:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152829650] [2024-06-03 20:12:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152829650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:12:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101961207] [2024-06-03 20:12:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:43,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:12:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:12:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:12:43,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:43,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 532 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-06-03 20:12:43,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:43,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:43,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:45,020 INFO L124 PetriNetUnfolderBase]: 4265/5977 cut-off events. [2024-06-03 20:12:45,020 INFO L125 PetriNetUnfolderBase]: For 7517/7624 co-relation queries the response was YES. [2024-06-03 20:12:45,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17794 conditions, 5977 events. 4265/5977 cut-off events. For 7517/7624 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30447 event pairs, 1988 based on Foata normal form. 2/5959 useless extension candidates. Maximal degree in co-relation 17761. Up to 5857 conditions per place. [2024-06-03 20:12:45,066 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 78 selfloop transitions, 34 changer transitions 0/120 dead transitions. [2024-06-03 20:12:45,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 120 transitions, 956 flow [2024-06-03 20:12:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-06-03 20:12:45,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-03 20:12:45,068 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 532 flow. Second operand 8 states and 184 transitions. [2024-06-03 20:12:45,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 120 transitions, 956 flow [2024-06-03 20:12:45,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 120 transitions, 937 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 20:12:45,075 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 695 flow [2024-06-03 20:12:45,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=695, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2024-06-03 20:12:45,078 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2024-06-03 20:12:45,078 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 695 flow [2024-06-03 20:12:45,078 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-06-03 20:12:45,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:45,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:45,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:12:45,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:45,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1181792172, now seen corresponding path program 1 times [2024-06-03 20:12:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32956945] [2024-06-03 20:12:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32956945] [2024-06-03 20:12:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32956945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:48,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756924389] [2024-06-03 20:12:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:48,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:48,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 695 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-06-03 20:12:48,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:48,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:48,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:49,663 INFO L124 PetriNetUnfolderBase]: 4268/5987 cut-off events. [2024-06-03 20:12:49,663 INFO L125 PetriNetUnfolderBase]: For 13905/14010 co-relation queries the response was YES. [2024-06-03 20:12:49,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20003 conditions, 5987 events. 4268/5987 cut-off events. For 13905/14010 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30222 event pairs, 2014 based on Foata normal form. 6/5973 useless extension candidates. Maximal degree in co-relation 19967. Up to 5930 conditions per place. [2024-06-03 20:12:49,697 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 80 selfloop transitions, 20 changer transitions 0/108 dead transitions. [2024-06-03 20:12:49,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 966 flow [2024-06-03 20:12:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-03 20:12:49,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025 [2024-06-03 20:12:49,699 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 695 flow. Second operand 8 states and 161 transitions. [2024-06-03 20:12:49,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 966 flow [2024-06-03 20:12:49,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 108 transitions, 909 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-03 20:12:49,717 INFO L231 Difference]: Finished difference. Result has 91 places, 99 transitions, 728 flow [2024-06-03 20:12:49,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2024-06-03 20:12:49,719 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2024-06-03 20:12:49,719 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 728 flow [2024-06-03 20:12:49,720 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-06-03 20:12:49,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:49,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:49,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:12:49,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:49,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 306268278, now seen corresponding path program 2 times [2024-06-03 20:12:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040736822] [2024-06-03 20:12:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:49,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040736822] [2024-06-03 20:12:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040736822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:12:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134522180] [2024-06-03 20:12:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:12:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:12:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:12:52,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:52,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 728 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:52,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:52,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:52,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:53,940 INFO L124 PetriNetUnfolderBase]: 4284/6010 cut-off events. [2024-06-03 20:12:53,940 INFO L125 PetriNetUnfolderBase]: For 15978/16085 co-relation queries the response was YES. [2024-06-03 20:12:53,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20551 conditions, 6010 events. 4284/6010 cut-off events. For 15978/16085 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30585 event pairs, 1990 based on Foata normal form. 2/5992 useless extension candidates. Maximal degree in co-relation 20512. Up to 5908 conditions per place. [2024-06-03 20:12:53,972 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 90 selfloop transitions, 25 changer transitions 0/123 dead transitions. [2024-06-03 20:12:53,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 123 transitions, 1112 flow [2024-06-03 20:12:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-03 20:12:53,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445 [2024-06-03 20:12:53,975 INFO L175 Difference]: Start difference. First operand has 91 places, 99 transitions, 728 flow. Second operand 8 states and 178 transitions. [2024-06-03 20:12:53,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 123 transitions, 1112 flow [2024-06-03 20:12:53,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 123 transitions, 1057 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 20:12:53,989 INFO L231 Difference]: Finished difference. Result has 94 places, 101 transitions, 760 flow [2024-06-03 20:12:53,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=760, PETRI_PLACES=94, PETRI_TRANSITIONS=101} [2024-06-03 20:12:53,990 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2024-06-03 20:12:53,991 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 760 flow [2024-06-03 20:12:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:53,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:53,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:12:53,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:53,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 307825098, now seen corresponding path program 3 times [2024-06-03 20:12:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297887775] [2024-06-03 20:12:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:12:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297887775] [2024-06-03 20:12:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297887775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:57,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:57,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:12:57,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575032052] [2024-06-03 20:12:57,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:57,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:12:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:12:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:12:57,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:12:57,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 760 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-06-03 20:12:57,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:57,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:12:57,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:59,768 INFO L124 PetriNetUnfolderBase]: 4297/6033 cut-off events. [2024-06-03 20:12:59,768 INFO L125 PetriNetUnfolderBase]: For 18716/18823 co-relation queries the response was YES. [2024-06-03 20:12:59,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21171 conditions, 6033 events. 4297/6033 cut-off events. For 18716/18823 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30735 event pairs, 1993 based on Foata normal form. 2/6015 useless extension candidates. Maximal degree in co-relation 21131. Up to 5881 conditions per place. [2024-06-03 20:12:59,803 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 85 selfloop transitions, 39 changer transitions 0/132 dead transitions. [2024-06-03 20:12:59,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 1224 flow [2024-06-03 20:12:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 20:12:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 20:12:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2024-06-03 20:12:59,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-06-03 20:12:59,805 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 760 flow. Second operand 9 states and 204 transitions. [2024-06-03 20:12:59,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 1224 flow [2024-06-03 20:12:59,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 132 transitions, 1163 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 20:12:59,819 INFO L231 Difference]: Finished difference. Result has 97 places, 103 transitions, 822 flow [2024-06-03 20:12:59,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=822, PETRI_PLACES=97, PETRI_TRANSITIONS=103} [2024-06-03 20:12:59,820 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2024-06-03 20:12:59,820 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 822 flow [2024-06-03 20:12:59,820 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-06-03 20:12:59,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:59,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:59,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:12:59,820 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:12:59,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 307876248, now seen corresponding path program 4 times [2024-06-03 20:12:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870543676] [2024-06-03 20:12:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870543676] [2024-06-03 20:13:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870543676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:02,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301660309] [2024-06-03 20:13:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:02,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:02,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:03,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:13:03,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 822 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-06-03 20:13:03,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:03,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:13:03,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:04,808 INFO L124 PetriNetUnfolderBase]: 4484/6319 cut-off events. [2024-06-03 20:13:04,808 INFO L125 PetriNetUnfolderBase]: For 22832/22949 co-relation queries the response was YES. [2024-06-03 20:13:04,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22932 conditions, 6319 events. 4484/6319 cut-off events. For 22832/22949 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 32349 event pairs, 1925 based on Foata normal form. 2/6293 useless extension candidates. Maximal degree in co-relation 22891. Up to 5864 conditions per place. [2024-06-03 20:13:04,842 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 102 selfloop transitions, 39 changer transitions 0/149 dead transitions. [2024-06-03 20:13:04,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 149 transitions, 1442 flow [2024-06-03 20:13:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:13:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:13:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-06-03 20:13:04,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975 [2024-06-03 20:13:04,843 INFO L175 Difference]: Start difference. First operand has 97 places, 103 transitions, 822 flow. Second operand 8 states and 199 transitions. [2024-06-03 20:13:04,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 149 transitions, 1442 flow [2024-06-03 20:13:04,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 149 transitions, 1331 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-03 20:13:04,864 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 915 flow [2024-06-03 20:13:04,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=915, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2024-06-03 20:13:04,865 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2024-06-03 20:13:04,865 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 915 flow [2024-06-03 20:13:04,865 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-06-03 20:13:04,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:04,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:04,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:13:04,866 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:04,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash -253272404, now seen corresponding path program 1 times [2024-06-03 20:13:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30989768] [2024-06-03 20:13:04,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30989768] [2024-06-03 20:13:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30989768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:08,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:08,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:08,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042539607] [2024-06-03 20:13:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:08,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:08,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:13:08,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 915 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:08,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:08,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:13:08,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:10,332 INFO L124 PetriNetUnfolderBase]: 5649/7921 cut-off events. [2024-06-03 20:13:10,332 INFO L125 PetriNetUnfolderBase]: For 30170/30302 co-relation queries the response was YES. [2024-06-03 20:13:10,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28595 conditions, 7921 events. 5649/7921 cut-off events. For 30170/30302 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 39725 event pairs, 1887 based on Foata normal form. 4/7895 useless extension candidates. Maximal degree in co-relation 28552. Up to 7761 conditions per place. [2024-06-03 20:13:10,370 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 95 selfloop transitions, 24 changer transitions 0/126 dead transitions. [2024-06-03 20:13:10,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 126 transitions, 1259 flow [2024-06-03 20:13:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:13:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:13:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-03 20:13:10,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-06-03 20:13:10,372 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 915 flow. Second operand 6 states and 136 transitions. [2024-06-03 20:13:10,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 126 transitions, 1259 flow [2024-06-03 20:13:10,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 126 transitions, 1155 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-03 20:13:10,422 INFO L231 Difference]: Finished difference. Result has 101 places, 112 transitions, 909 flow [2024-06-03 20:13:10,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=909, PETRI_PLACES=101, PETRI_TRANSITIONS=112} [2024-06-03 20:13:10,423 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2024-06-03 20:13:10,423 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 909 flow [2024-06-03 20:13:10,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:10,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:10,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:10,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:13:10,424 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:10,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -100869822, now seen corresponding path program 2 times [2024-06-03 20:13:10,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:10,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070416822] [2024-06-03 20:13:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:13,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070416822] [2024-06-03 20:13:13,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070416822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:13,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25043732] [2024-06-03 20:13:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:13,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:13,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:13:13,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 909 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:13,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:13,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:13:13,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:15,252 INFO L124 PetriNetUnfolderBase]: 5646/7917 cut-off events. [2024-06-03 20:13:15,252 INFO L125 PetriNetUnfolderBase]: For 28963/29096 co-relation queries the response was YES. [2024-06-03 20:13:15,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27978 conditions, 7917 events. 5646/7917 cut-off events. For 28963/29096 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 39789 event pairs, 2291 based on Foata normal form. 12/7901 useless extension candidates. Maximal degree in co-relation 27933. Up to 7805 conditions per place. [2024-06-03 20:13:15,300 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 90 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-06-03 20:13:15,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 1184 flow [2024-06-03 20:13:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:13:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:13:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-06-03 20:13:15,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2024-06-03 20:13:15,302 INFO L175 Difference]: Start difference. First operand has 101 places, 112 transitions, 909 flow. Second operand 6 states and 128 transitions. [2024-06-03 20:13:15,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 1184 flow [2024-06-03 20:13:15,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 121 transitions, 1119 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-03 20:13:15,335 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 928 flow [2024-06-03 20:13:15,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2024-06-03 20:13:15,335 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2024-06-03 20:13:15,336 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 928 flow [2024-06-03 20:13:15,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:15,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:15,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:15,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:13:15,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:15,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -100866846, now seen corresponding path program 1 times [2024-06-03 20:13:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582440603] [2024-06-03 20:13:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582440603] [2024-06-03 20:13:17,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582440603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503189079] [2024-06-03 20:13:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:17,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:17,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:13:17,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 928 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:17,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:17,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:13:17,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:19,601 INFO L124 PetriNetUnfolderBase]: 5650/7923 cut-off events. [2024-06-03 20:13:19,601 INFO L125 PetriNetUnfolderBase]: For 29184/29305 co-relation queries the response was YES. [2024-06-03 20:13:19,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28038 conditions, 7923 events. 5650/7923 cut-off events. For 29184/29305 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 39835 event pairs, 2291 based on Foata normal form. 0/7895 useless extension candidates. Maximal degree in co-relation 27992. Up to 7805 conditions per place. [2024-06-03 20:13:19,640 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 88 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2024-06-03 20:13:19,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 125 transitions, 1226 flow [2024-06-03 20:13:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:13:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:13:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-03 20:13:19,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43666666666666665 [2024-06-03 20:13:19,643 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 928 flow. Second operand 6 states and 131 transitions. [2024-06-03 20:13:19,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 125 transitions, 1226 flow [2024-06-03 20:13:19,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 1163 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:19,676 INFO L231 Difference]: Finished difference. Result has 106 places, 117 transitions, 981 flow [2024-06-03 20:13:19,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=106, PETRI_TRANSITIONS=117} [2024-06-03 20:13:19,677 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2024-06-03 20:13:19,677 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 117 transitions, 981 flow [2024-06-03 20:13:19,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:19,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:19,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:19,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:13:19,677 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:19,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash -99318396, now seen corresponding path program 2 times [2024-06-03 20:13:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017468092] [2024-06-03 20:13:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017468092] [2024-06-03 20:13:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017468092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549716888] [2024-06-03 20:13:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:22,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:22,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:22,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:13:22,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 117 transitions, 981 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:22,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:22,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:13:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:23,927 INFO L124 PetriNetUnfolderBase]: 5650/7903 cut-off events. [2024-06-03 20:13:23,927 INFO L125 PetriNetUnfolderBase]: For 32591/32732 co-relation queries the response was YES. [2024-06-03 20:13:23,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28897 conditions, 7903 events. 5650/7903 cut-off events. For 32591/32732 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 40027 event pairs, 2143 based on Foata normal form. 0/7876 useless extension candidates. Maximal degree in co-relation 28850. Up to 7733 conditions per place. [2024-06-03 20:13:23,973 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 97 selfloop transitions, 43 changer transitions 0/147 dead transitions. [2024-06-03 20:13:23,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 1553 flow [2024-06-03 20:13:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-06-03 20:13:23,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2024-06-03 20:13:23,975 INFO L175 Difference]: Start difference. First operand has 106 places, 117 transitions, 981 flow. Second operand 7 states and 158 transitions. [2024-06-03 20:13:23,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 1553 flow [2024-06-03 20:13:24,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 147 transitions, 1459 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:24,012 INFO L231 Difference]: Finished difference. Result has 111 places, 129 transitions, 1194 flow [2024-06-03 20:13:24,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1194, PETRI_PLACES=111, PETRI_TRANSITIONS=129} [2024-06-03 20:13:24,013 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 58 predicate places. [2024-06-03 20:13:24,013 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 129 transitions, 1194 flow [2024-06-03 20:13:24,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:24,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:24,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:24,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:13:24,013 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:24,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash 604406094, now seen corresponding path program 3 times [2024-06-03 20:13:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:24,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285150586] [2024-06-03 20:13:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:24,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285150586] [2024-06-03 20:13:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285150586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:26,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:26,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170023177] [2024-06-03 20:13:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:26,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:26,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2024-06-03 20:13:26,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 129 transitions, 1194 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:26,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:26,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2024-06-03 20:13:26,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:28,199 INFO L124 PetriNetUnfolderBase]: 5646/7912 cut-off events. [2024-06-03 20:13:28,199 INFO L125 PetriNetUnfolderBase]: For 40886/41040 co-relation queries the response was YES. [2024-06-03 20:13:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30906 conditions, 7912 events. 5646/7912 cut-off events. For 40886/41040 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 40182 event pairs, 2218 based on Foata normal form. 19/7908 useless extension candidates. Maximal degree in co-relation 30856. Up to 7823 conditions per place. [2024-06-03 20:13:28,354 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 118 selfloop transitions, 21 changer transitions 0/146 dead transitions. [2024-06-03 20:13:28,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 146 transitions, 1609 flow [2024-06-03 20:13:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:13:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:13:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-03 20:13:28,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.395 [2024-06-03 20:13:28,355 INFO L175 Difference]: Start difference. First operand has 111 places, 129 transitions, 1194 flow. Second operand 8 states and 158 transitions. [2024-06-03 20:13:28,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 146 transitions, 1609 flow [2024-06-03 20:13:28,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 146 transitions, 1511 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-06-03 20:13:28,396 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1257 flow [2024-06-03 20:13:28,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1257, PETRI_PLACES=117, PETRI_TRANSITIONS=135} [2024-06-03 20:13:28,397 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2024-06-03 20:13:28,397 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1257 flow [2024-06-03 20:13:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:28,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:28,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:28,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:13:28,398 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:28,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash -582041308, now seen corresponding path program 1 times [2024-06-03 20:13:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205930946] [2024-06-03 20:13:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:30,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205930946] [2024-06-03 20:13:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205930946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909102375] [2024-06-03 20:13:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:30,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:30,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:13:30,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 135 transitions, 1257 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-06-03 20:13:30,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:30,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:13:30,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:32,015 INFO L124 PetriNetUnfolderBase]: 4786/6739 cut-off events. [2024-06-03 20:13:32,015 INFO L125 PetriNetUnfolderBase]: For 36123/36131 co-relation queries the response was YES. [2024-06-03 20:13:32,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26801 conditions, 6739 events. 4786/6739 cut-off events. For 36123/36131 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 35220 event pairs, 2123 based on Foata normal form. 2/6606 useless extension candidates. Maximal degree in co-relation 26749. Up to 6650 conditions per place. [2024-06-03 20:13:32,060 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 123 selfloop transitions, 29 changer transitions 0/160 dead transitions. [2024-06-03 20:13:32,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 160 transitions, 1733 flow [2024-06-03 20:13:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-06-03 20:13:32,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-03 20:13:32,061 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1257 flow. Second operand 7 states and 161 transitions. [2024-06-03 20:13:32,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 160 transitions, 1733 flow [2024-06-03 20:13:32,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 160 transitions, 1652 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:32,094 INFO L231 Difference]: Finished difference. Result has 122 places, 145 transitions, 1361 flow [2024-06-03 20:13:32,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1361, PETRI_PLACES=122, PETRI_TRANSITIONS=145} [2024-06-03 20:13:32,095 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 69 predicate places. [2024-06-03 20:13:32,095 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 145 transitions, 1361 flow [2024-06-03 20:13:32,095 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-06-03 20:13:32,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:32,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:32,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:13:32,096 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:32,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1474682938, now seen corresponding path program 2 times [2024-06-03 20:13:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912848308] [2024-06-03 20:13:32,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 20:13:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912848308] [2024-06-03 20:13:33,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912848308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:33,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:33,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352535808] [2024-06-03 20:13:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:33,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:33,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:33,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-06-03 20:13:33,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 145 transitions, 1361 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-06-03 20:13:33,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:33,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-06-03 20:13:33,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:35,503 INFO L124 PetriNetUnfolderBase]: 4786/6738 cut-off events. [2024-06-03 20:13:35,503 INFO L125 PetriNetUnfolderBase]: For 36735/36743 co-relation queries the response was YES. [2024-06-03 20:13:35,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27575 conditions, 6738 events. 4786/6738 cut-off events. For 36735/36743 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 35163 event pairs, 2127 based on Foata normal form. 2/6606 useless extension candidates. Maximal degree in co-relation 27519. Up to 6689 conditions per place. [2024-06-03 20:13:35,558 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 134 selfloop transitions, 19 changer transitions 0/161 dead transitions. [2024-06-03 20:13:35,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 161 transitions, 1799 flow [2024-06-03 20:13:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:13:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:13:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-06-03 20:13:35,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-03 20:13:35,559 INFO L175 Difference]: Start difference. First operand has 122 places, 145 transitions, 1361 flow. Second operand 6 states and 132 transitions. [2024-06-03 20:13:35,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 161 transitions, 1799 flow [2024-06-03 20:13:35,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 161 transitions, 1730 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 20:13:35,598 INFO L231 Difference]: Finished difference. Result has 127 places, 154 transitions, 1463 flow [2024-06-03 20:13:35,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1463, PETRI_PLACES=127, PETRI_TRANSITIONS=154} [2024-06-03 20:13:35,598 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2024-06-03 20:13:35,599 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 154 transitions, 1463 flow [2024-06-03 20:13:35,599 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-06-03 20:13:35,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:35,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:35,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:13:35,599 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-03 20:13:35,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1488872258, now seen corresponding path program 1 times [2024-06-03 20:13:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109630833] [2024-06-03 20:13:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:13:35,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:13:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:13:35,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:13:35,677 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:13:35,678 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 8 remaining) [2024-06-03 20:13:35,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-06-03 20:13:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-06-03 20:13:35,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 8 remaining) [2024-06-03 20:13:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-06-03 20:13:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-06-03 20:13:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-06-03 20:13:35,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2024-06-03 20:13:35,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:13:35,682 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-06-03 20:13:35,687 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:13:35,687 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:13:35,722 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,723 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,725 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,727 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:35,731 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:13:35,741 INFO L507 ceAbstractionStarter]: Automizer considered 4 witness invariants [2024-06-03 20:13:35,742 INFO L508 ceAbstractionStarter]: WitnessConsidered=4 [2024-06-03 20:13:35,742 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:13:35 BasicIcfg [2024-06-03 20:13:35,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:13:35,743 INFO L158 Benchmark]: Toolchain (without parser) took 87506.62ms. Allocated memory was 163.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 74.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 935.9MB. Max. memory is 16.1GB. [2024-06-03 20:13:35,743 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 73.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:13:35,743 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 163.6MB. Free memory was 92.3MB in the beginning and 92.0MB in the end (delta: 237.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:13:35,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 955.19ms. Allocated memory is still 163.6MB. Free memory was 74.5MB in the beginning and 80.2MB in the end (delta: -5.8MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-06-03 20:13:35,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.55ms. Allocated memory is still 163.6MB. Free memory was 79.4MB in the beginning and 75.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:13:35,744 INFO L158 Benchmark]: Boogie Preprocessor took 65.61ms. Allocated memory is still 163.6MB. Free memory was 75.2MB in the beginning and 69.8MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:13:35,745 INFO L158 Benchmark]: RCFGBuilder took 1502.35ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 69.8MB in the beginning and 132.1MB in the end (delta: -62.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-06-03 20:13:35,745 INFO L158 Benchmark]: TraceAbstraction took 84888.00ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 131.1MB in the beginning and 1.1GB in the end (delta: -976.6MB). Peak memory consumption was 934.9MB. Max. memory is 16.1GB. [2024-06-03 20:13:35,747 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 73.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.19ms. Allocated memory is still 163.6MB. Free memory was 92.3MB in the beginning and 92.0MB in the end (delta: 237.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 955.19ms. Allocated memory is still 163.6MB. Free memory was 74.5MB in the beginning and 80.2MB in the end (delta: -5.8MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.55ms. Allocated memory is still 163.6MB. Free memory was 79.4MB in the beginning and 75.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.61ms. Allocated memory is still 163.6MB. Free memory was 75.2MB in the beginning and 69.8MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1502.35ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 69.8MB in the beginning and 132.1MB in the end (delta: -62.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 84888.00ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 131.1MB in the beginning and 1.1GB in the end (delta: -976.6MB). Peak memory consumption was 934.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: 889]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L882] 0 pthread_t t2229; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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_buff0_thd4=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$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L883] 0 //@ ghost multithreaded = 1; [L883] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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_buff0_thd4=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$r_buff1_thd4=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, t2229=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L884] 0 pthread_t t2230; [L885] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_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_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!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 || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!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 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))); [L885] 0 x [L885] 0 x [L885] 0 x [L885] 0 x [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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_buff0_thd4=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$r_buff1_thd4=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, t2229=-2, t2230=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L885] 0 x [L885] 0 x [L885] 0 x [L885] 0 x [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L885] 0 __unbuffered_p2_EAX$read_delayed_var [L886] 0 pthread_t t2231; [L887] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_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_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!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 || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!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 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))); [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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_buff0_thd4=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$r_buff1_thd4=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, t2229=-2, t2230=-1, t2231=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 x [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L887] 0 __unbuffered_p2_EAX$read_delayed_var [L888] 0 pthread_t t2232; [L821] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 3 x$flush_delayed = weak$$choice2 [L824] EXPR 3 \read(x) [L824] 3 x$mem_tmp = x [L825] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L826] 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)))) [L826] EXPR 3 \read(x) [L826] 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)))) [L826] 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)))) [L827] 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)))) [L828] 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)))) [L829] 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)))) [L830] 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)))) [L831] 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)))) [L832] 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)))) [L833] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L834] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L835] EXPR 3 \read(x) [L835] 3 __unbuffered_p2_EAX = x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L836] 3 x = x$flush_delayed ? x$mem_tmp : x [L837] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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_buff0_thd4=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$r_buff1_thd4=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=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L889] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd4 == (_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_used == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EBX) && (__unbuffered_p0_EBX <= 1)) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))))) && (!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 || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff0) && (x$w_buff0 <= 1)) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))))) && (!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 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd4 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((0 <= x$w_buff1) && (x$w_buff1 <= 1)) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd4 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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_buff0_thd4=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$r_buff1_thd4=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, t2229=-2, t2230=-1, t2231=0, weak$$choice0=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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: 885]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 883]: 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: 889]: 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: 887]: 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: 885]: 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 9 procedures, 81 locations, 8 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: 84.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1200 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1018 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5585 IncrementalHoareTripleChecker+Invalid, 5762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 41 mSDtfsCounter, 5585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, InterpolantAutomatonStates: 124, 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, 49.5s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 27525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-03 20:13:35,792 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