./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.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/safe020_rmo.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/safe020_rmo.i ./goblint.2024-05-21_14-57-05.files/protection/safe020_rmo.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:37,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:12:37,826 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:37,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:12:37,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:12:37,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:12:37,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:12:37,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:12:37,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:12:37,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:12:37,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:12:37,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:12:37,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:12:37,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:12:37,859 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:12:37,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:12:37,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:12:37,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:12:37,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:12:37,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:12:37,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:12:37,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:12:37,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:12:37,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:12:37,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:12:37,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:12:37,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:12:37,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:12:37,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:12:37,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:12:37,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:12:37,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:12:37,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:12:37,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:12:37,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:12:37,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:12:37,864 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:38,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:12:38,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:12:38,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:12:38,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:12:38,089 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:12:38,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2024-06-03 20:12:39,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:12:39,334 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:12:39,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2024-06-03 20:12:39,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87986325/5d58241042f74ab4a7383cdccb102f74/FLAG70d73065b [2024-06-03 20:12:39,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87986325/5d58241042f74ab4a7383cdccb102f74 [2024-06-03 20:12:39,374 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:12:39,375 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:12:39,376 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/safe020_rmo.yml/witness.yml [2024-06-03 20:12:39,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:12:39,557 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:12:39,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:12:39,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:12:39,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:12:39,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:12:39" (1/2) ... [2024-06-03 20:12:39,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a69fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:12:39, skipping insertion in model container [2024-06-03 20:12:39,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:12:39" (1/2) ... [2024-06-03 20:12:39,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3132d566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:12:39, skipping insertion in model container [2024-06-03 20:12:39,563 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:39" (2/2) ... [2024-06-03 20:12:39,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a69fe7e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:39, skipping insertion in model container [2024-06-03 20:12:39,565 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:39" (2/2) ... [2024-06-03 20:12:39,565 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:12:39,674 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:12:39,675 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-03 20:12:39,675 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-03 20:12:39,676 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 1) && __unbuffered_p2_EAX$read_delayed_var == & x) && (*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1))))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-03 20:12:39,676 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:12:39,676 INFO L106 edCorrectnessWitness]: ghost_update [L850-L850] multithreaded = 1; [2024-06-03 20:12:39,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:12:40,010 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:12:40,024 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:12:40,156 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:12:40,183 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:12:40,184 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:12:40 WrapperNode [2024-06-03 20:12:40,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:12:40,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:12:40,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:12:40,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:12:40,189 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:40" (1/1) ... [2024-06-03 20:12:40,206 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:40" (1/1) ... [2024-06-03 20:12:40,233 INFO L138 Inliner]: procedures = 175, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 204 [2024-06-03 20:12:40,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:12:40,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:12:40,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:12:40,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:12:40,250 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:40" (1/1) ... [2024-06-03 20:12:40,250 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:40" (1/1) ... [2024-06-03 20:12:40,253 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:40" (1/1) ... [2024-06-03 20:12:40,272 INFO L175 MemorySlicer]: Split 47 memory accesses to 2 slices as follows [2, 45]. 96 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-06-03 20:12:40,272 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:40" (1/1) ... [2024-06-03 20:12:40,273 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:40" (1/1) ... [2024-06-03 20:12:40,283 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:40" (1/1) ... [2024-06-03 20:12:40,284 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:40" (1/1) ... [2024-06-03 20:12:40,287 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:40" (1/1) ... [2024-06-03 20:12:40,288 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:40" (1/1) ... [2024-06-03 20:12:40,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:12:40,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:12:40,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:12:40,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:12:40,302 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:40" (1/1) ... [2024-06-03 20:12:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:12:40,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:12:40,324 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:40,331 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:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:12:40,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:12:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:12:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:12:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:12:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:12:40,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:12:40,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:12:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:12:40,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:12:40,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:12:40,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:12:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:12:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:12:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:12:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:12:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:12:40,360 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:40,495 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:12:40,496 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:12:40,944 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:12:40,945 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:12:41,271 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:12:41,272 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:12:41,272 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:12:41 BoogieIcfgContainer [2024-06-03 20:12:41,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:12:41,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:12:41,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:12:41,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:12:41,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:12:39" (1/4) ... [2024-06-03 20:12:41,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5fed3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:12:41, skipping insertion in model container [2024-06-03 20:12:41,277 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:39" (2/4) ... [2024-06-03 20:12:41,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5fed3a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:12:41, skipping insertion in model container [2024-06-03 20:12:41,278 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:40" (3/4) ... [2024-06-03 20:12:41,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5fed3a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:12:41, skipping insertion in model container [2024-06-03 20:12:41,278 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:41" (4/4) ... [2024-06-03 20:12:41,279 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2024-06-03 20:12:41,292 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:12:41,292 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:12:41,292 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:12:41,340 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:12:41,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 20:12:41,396 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-03 20:12:41,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:12:41,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:12:41,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-03 20:12:41,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-03 20:12:41,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:12:41,446 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;@462aa5f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:12:41,446 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:12:41,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:12:41,451 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 20:12:41,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:12:41,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:41,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:12:41,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:41,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1679829102, now seen corresponding path program 1 times [2024-06-03 20:12:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475503580] [2024-06-03 20:12:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:43,503 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,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475503580] [2024-06-03 20:12:43,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475503580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:43,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:43,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:12:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539757156] [2024-06-03 20:12:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:43,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:12:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:43,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:12:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:12:43,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:43,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:43,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:43,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:43,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:43,944 INFO L124 PetriNetUnfolderBase]: 716/1134 cut-off events. [2024-06-03 20:12:43,945 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-03 20:12:43,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 1134 events. 716/1134 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5038 event pairs, 403 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2299. Up to 1103 conditions per place. [2024-06-03 20:12:43,953 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 29 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 20:12:43,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow [2024-06-03 20:12:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 20:12:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 20:12:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-06-03 20:12:43,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-03 20:12:43,962 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 4 states and 77 transitions. [2024-06-03 20:12:43,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow [2024-06-03 20:12:43,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:43,966 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 117 flow [2024-06-03 20:12:43,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-06-03 20:12:43,969 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-06-03 20:12:43,969 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 117 flow [2024-06-03 20:12:43,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:43,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:43,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:43,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:12:43,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:43,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash -591902323, now seen corresponding path program 1 times [2024-06-03 20:12:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015370908] [2024-06-03 20:12:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:45,488 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:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015370908] [2024-06-03 20:12:45,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015370908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:45,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:12:45,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977944496] [2024-06-03 20:12:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:45,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:12:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:12:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:12:45,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:45,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:45,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:45,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:45,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:46,045 INFO L124 PetriNetUnfolderBase]: 718/1136 cut-off events. [2024-06-03 20:12:46,045 INFO L125 PetriNetUnfolderBase]: For 182/184 co-relation queries the response was YES. [2024-06-03 20:12:46,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 1136 events. 718/1136 cut-off events. For 182/184 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5134 event pairs, 251 based on Foata normal form. 2/1129 useless extension candidates. Maximal degree in co-relation 2541. Up to 1071 conditions per place. [2024-06-03 20:12:46,051 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 34 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2024-06-03 20:12:46,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 263 flow [2024-06-03 20:12:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-03 20:12:46,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 20:12:46,053 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 117 flow. Second operand 5 states and 95 transitions. [2024-06-03 20:12:46,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 263 flow [2024-06-03 20:12:46,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 263 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:12:46,055 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 197 flow [2024-06-03 20:12:46,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-03 20:12:46,056 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-03 20:12:46,056 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 197 flow [2024-06-03 20:12:46,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:46,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:46,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:46,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:12:46,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:46,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash -591663313, now seen corresponding path program 2 times [2024-06-03 20:12:46,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:46,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244556122] [2024-06-03 20:12:46,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:47,463 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:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244556122] [2024-06-03 20:12:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244556122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 20:12:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009134860] [2024-06-03 20:12:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:47,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 20:12:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:47,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 20:12:47,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 20:12:47,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:47,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:47,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:47,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:47,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:47,906 INFO L124 PetriNetUnfolderBase]: 716/1135 cut-off events. [2024-06-03 20:12:47,906 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-06-03 20:12:47,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1135 events. 716/1135 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5031 event pairs, 271 based on Foata normal form. 2/1136 useless extension candidates. Maximal degree in co-relation 2787. Up to 1070 conditions per place. [2024-06-03 20:12:47,912 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 39 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-03 20:12:47,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 331 flow [2024-06-03 20:12:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:12:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:12:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-03 20:12:47,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-03 20:12:47,917 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 197 flow. Second operand 5 states and 100 transitions. [2024-06-03 20:12:47,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 331 flow [2024-06-03 20:12:47,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 323 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-03 20:12:47,922 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 218 flow [2024-06-03 20:12:47,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-03 20:12:47,923 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-03 20:12:47,923 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 218 flow [2024-06-03 20:12:47,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:47,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:47,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:47,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:12:47,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:47,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1169351654, now seen corresponding path program 1 times [2024-06-03 20:12:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737406089] [2024-06-03 20:12:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:49,215 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:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:49,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737406089] [2024-06-03 20:12:49,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737406089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:49,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:49,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:12:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448114037] [2024-06-03 20:12:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:49,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:12:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:49,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:12:49,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:12:49,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:49,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:49,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:49,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:49,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:49,862 INFO L124 PetriNetUnfolderBase]: 757/1197 cut-off events. [2024-06-03 20:12:49,862 INFO L125 PetriNetUnfolderBase]: For 408/410 co-relation queries the response was YES. [2024-06-03 20:12:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 1197 events. 757/1197 cut-off events. For 408/410 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5421 event pairs, 392 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 2873. Up to 1166 conditions per place. [2024-06-03 20:12:49,869 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 37 selfloop transitions, 13 changer transitions 0/57 dead transitions. [2024-06-03 20:12:49,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 359 flow [2024-06-03 20:12:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-03 20:12:49,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-03 20:12:49,870 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 218 flow. Second operand 6 states and 103 transitions. [2024-06-03 20:12:49,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 359 flow [2024-06-03 20:12:49,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 321 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:12:49,873 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 262 flow [2024-06-03 20:12:49,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2024-06-03 20:12:49,874 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-03 20:12:49,874 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 262 flow [2024-06-03 20:12:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:49,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:49,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:49,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:12:49,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:49,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash 47117487, now seen corresponding path program 1 times [2024-06-03 20:12:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:49,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738884271] [2024-06-03 20:12:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:51,600 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:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:51,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738884271] [2024-06-03 20:12:51,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738884271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:51,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:51,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:51,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675571250] [2024-06-03 20:12:51,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:51,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:51,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:51,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:51,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:51,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:51,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:51,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:51,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:52,616 INFO L124 PetriNetUnfolderBase]: 769/1217 cut-off events. [2024-06-03 20:12:52,617 INFO L125 PetriNetUnfolderBase]: For 676/678 co-relation queries the response was YES. [2024-06-03 20:12:52,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3176 conditions, 1217 events. 769/1217 cut-off events. For 676/678 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5489 event pairs, 310 based on Foata normal form. 6/1222 useless extension candidates. Maximal degree in co-relation 3150. Up to 1143 conditions per place. [2024-06-03 20:12:52,623 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 44 selfloop transitions, 21 changer transitions 0/72 dead transitions. [2024-06-03 20:12:52,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 462 flow [2024-06-03 20:12:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:12:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:12:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 20:12:52,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-03 20:12:52,627 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 262 flow. Second operand 7 states and 128 transitions. [2024-06-03 20:12:52,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 462 flow [2024-06-03 20:12:52,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 20:12:52,635 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 369 flow [2024-06-03 20:12:52,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-03 20:12:52,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-03 20:12:52,637 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 369 flow [2024-06-03 20:12:52,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:52,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:52,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:52,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:12:52,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:52,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1534550009, now seen corresponding path program 2 times [2024-06-03 20:12:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:52,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133986299] [2024-06-03 20:12:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:52,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:54,277 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:54,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:54,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133986299] [2024-06-03 20:12:54,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133986299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:54,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:54,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172012232] [2024-06-03 20:12:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:54,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:54,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:54,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:54,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:54,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:54,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:54,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:55,240 INFO L124 PetriNetUnfolderBase]: 773/1223 cut-off events. [2024-06-03 20:12:55,240 INFO L125 PetriNetUnfolderBase]: For 1443/1445 co-relation queries the response was YES. [2024-06-03 20:12:55,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 1223 events. 773/1223 cut-off events. For 1443/1445 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5618 event pairs, 266 based on Foata normal form. 6/1225 useless extension candidates. Maximal degree in co-relation 3619. Up to 1144 conditions per place. [2024-06-03 20:12:55,250 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 38 selfloop transitions, 31 changer transitions 0/76 dead transitions. [2024-06-03 20:12:55,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 583 flow [2024-06-03 20:12:55,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:12:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:12:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-03 20:12:55,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-03 20:12:55,252 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 369 flow. Second operand 8 states and 138 transitions. [2024-06-03 20:12:55,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 583 flow [2024-06-03 20:12:55,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 548 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 20:12:55,257 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 468 flow [2024-06-03 20:12:55,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=468, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-03 20:12:55,259 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-03 20:12:55,259 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 468 flow [2024-06-03 20:12:55,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:55,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:55,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:55,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:12:55,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:55,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1535688763, now seen corresponding path program 1 times [2024-06-03 20:12:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053033489] [2024-06-03 20:12:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:12:56,911 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:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:12:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053033489] [2024-06-03 20:12:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053033489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:12:56,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:12:56,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:12:56,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764717400] [2024-06-03 20:12:56,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:12:56,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:12:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:12:56,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:12:56,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:12:56,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:12:56,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 468 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:56,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:12:56,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:12:56,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:12:57,860 INFO L124 PetriNetUnfolderBase]: 769/1217 cut-off events. [2024-06-03 20:12:57,860 INFO L125 PetriNetUnfolderBase]: For 2265/2267 co-relation queries the response was YES. [2024-06-03 20:12:57,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3954 conditions, 1217 events. 769/1217 cut-off events. For 2265/2267 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5493 event pairs, 342 based on Foata normal form. 2/1218 useless extension candidates. Maximal degree in co-relation 3921. Up to 1165 conditions per place. [2024-06-03 20:12:57,867 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 58 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2024-06-03 20:12:57,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 82 transitions, 686 flow [2024-06-03 20:12:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:12:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:12:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:12:57,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 20:12:57,868 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 468 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:12:57,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 82 transitions, 686 flow [2024-06-03 20:12:57,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 82 transitions, 634 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-03 20:12:57,872 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 523 flow [2024-06-03 20:12:57,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2024-06-03 20:12:57,873 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2024-06-03 20:12:57,874 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 523 flow [2024-06-03 20:12:57,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:12:57,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:12:57,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:12:57,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:12:57,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:12:57,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:12:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1729481915, now seen corresponding path program 1 times [2024-06-03 20:12:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:12:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613494555] [2024-06-03 20:12:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:12:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:12:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:00,157 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:00,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:00,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613494555] [2024-06-03 20:13:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613494555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330103261] [2024-06-03 20:13:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:00,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:00,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:00,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 523 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:00,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:00,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:00,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:00,661 INFO L124 PetriNetUnfolderBase]: 754/1203 cut-off events. [2024-06-03 20:13:00,662 INFO L125 PetriNetUnfolderBase]: For 2801/2803 co-relation queries the response was YES. [2024-06-03 20:13:00,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1203 events. 754/1203 cut-off events. For 2801/2803 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5479 event pairs, 243 based on Foata normal form. 4/1199 useless extension candidates. Maximal degree in co-relation 4064. Up to 1121 conditions per place. [2024-06-03 20:13:00,669 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 55 selfloop transitions, 22 changer transitions 0/84 dead transitions. [2024-06-03 20:13:00,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 719 flow [2024-06-03 20:13:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-03 20:13:00,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-03 20:13:00,670 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 523 flow. Second operand 7 states and 117 transitions. [2024-06-03 20:13:00,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 719 flow [2024-06-03 20:13:00,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 673 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-03 20:13:00,674 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 550 flow [2024-06-03 20:13:00,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=550, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-06-03 20:13:00,675 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-03 20:13:00,675 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 550 flow [2024-06-03 20:13:00,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:00,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:00,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:00,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:13:00,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:00,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1156651383, now seen corresponding path program 2 times [2024-06-03 20:13:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312291210] [2024-06-03 20:13:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:02,840 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,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312291210] [2024-06-03 20:13:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312291210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:02,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571596917] [2024-06-03 20:13:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:02,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:02,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:02,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 550 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:02,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:02,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:02,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:03,548 INFO L124 PetriNetUnfolderBase]: 756/1210 cut-off events. [2024-06-03 20:13:03,548 INFO L125 PetriNetUnfolderBase]: For 2913/2913 co-relation queries the response was YES. [2024-06-03 20:13:03,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 1210 events. 756/1210 cut-off events. For 2913/2913 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5516 event pairs, 236 based on Foata normal form. 2/1207 useless extension candidates. Maximal degree in co-relation 4114. Up to 1125 conditions per place. [2024-06-03 20:13:03,554 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 68 selfloop transitions, 26 changer transitions 0/101 dead transitions. [2024-06-03 20:13:03,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 101 transitions, 895 flow [2024-06-03 20:13:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-03 20:13:03,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-03 20:13:03,555 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 550 flow. Second operand 7 states and 130 transitions. [2024-06-03 20:13:03,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 101 transitions, 895 flow [2024-06-03 20:13:03,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 101 transitions, 831 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:03,562 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 672 flow [2024-06-03 20:13:03,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2024-06-03 20:13:03,563 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2024-06-03 20:13:03,563 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 672 flow [2024-06-03 20:13:03,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:03,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:03,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:03,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 20:13:03,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:03,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:03,564 INFO L85 PathProgramCache]: Analyzing trace with hash 869418093, now seen corresponding path program 3 times [2024-06-03 20:13:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:03,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194822937] [2024-06-03 20:13:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:05,681 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:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194822937] [2024-06-03 20:13:05,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194822937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:05,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:05,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308721856] [2024-06-03 20:13:05,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:05,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:05,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:05,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:05,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:05,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 672 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:05,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:05,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:05,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:06,292 INFO L124 PetriNetUnfolderBase]: 759/1216 cut-off events. [2024-06-03 20:13:06,292 INFO L125 PetriNetUnfolderBase]: For 3327/3363 co-relation queries the response was YES. [2024-06-03 20:13:06,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 1216 events. 759/1216 cut-off events. For 3327/3363 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5527 event pairs, 243 based on Foata normal form. 6/1216 useless extension candidates. Maximal degree in co-relation 4259. Up to 1134 conditions per place. [2024-06-03 20:13:06,299 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 62 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2024-06-03 20:13:06,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 97 transitions, 905 flow [2024-06-03 20:13:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 20:13:06,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 20:13:06,300 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 672 flow. Second operand 7 states and 124 transitions. [2024-06-03 20:13:06,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 97 transitions, 905 flow [2024-06-03 20:13:06,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 97 transitions, 868 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-03 20:13:06,305 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 736 flow [2024-06-03 20:13:06,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=736, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-06-03 20:13:06,305 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 51 predicate places. [2024-06-03 20:13:06,306 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 736 flow [2024-06-03 20:13:06,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:06,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:06,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:06,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 20:13:06,306 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:06,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 325419698, now seen corresponding path program 1 times [2024-06-03 20:13:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602527725] [2024-06-03 20:13:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:07,663 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:07,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602527725] [2024-06-03 20:13:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602527725] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:07,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:07,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:13:07,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075188345] [2024-06-03 20:13:07,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:13:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:13:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:13:07,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:07,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 736 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:07,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:07,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:08,453 INFO L124 PetriNetUnfolderBase]: 1122/1725 cut-off events. [2024-06-03 20:13:08,453 INFO L125 PetriNetUnfolderBase]: For 4200/4209 co-relation queries the response was YES. [2024-06-03 20:13:08,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 1725 events. 1122/1725 cut-off events. For 4200/4209 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8114 event pairs, 634 based on Foata normal form. 3/1724 useless extension candidates. Maximal degree in co-relation 5697. Up to 1679 conditions per place. [2024-06-03 20:13:08,466 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 78 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2024-06-03 20:13:08,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 993 flow [2024-06-03 20:13:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:13:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:13:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-06-03 20:13:08,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42276422764227645 [2024-06-03 20:13:08,467 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 736 flow. Second operand 6 states and 104 transitions. [2024-06-03 20:13:08,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 993 flow [2024-06-03 20:13:08,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 921 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:08,473 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 783 flow [2024-06-03 20:13:08,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2024-06-03 20:13:08,473 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2024-06-03 20:13:08,474 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 783 flow [2024-06-03 20:13:08,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:08,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:08,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:08,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 20:13:08,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:08,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1156663473, now seen corresponding path program 4 times [2024-06-03 20:13:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957733015] [2024-06-03 20:13:08,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:10,500 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:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957733015] [2024-06-03 20:13:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957733015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:10,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182460438] [2024-06-03 20:13:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:10,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:10,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 783 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:10,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:10,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:10,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:11,278 INFO L124 PetriNetUnfolderBase]: 893/1455 cut-off events. [2024-06-03 20:13:11,278 INFO L125 PetriNetUnfolderBase]: For 3799/3824 co-relation queries the response was YES. [2024-06-03 20:13:11,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5175 conditions, 1455 events. 893/1455 cut-off events. For 3799/3824 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7113 event pairs, 309 based on Foata normal form. 2/1453 useless extension candidates. Maximal degree in co-relation 5128. Up to 1320 conditions per place. [2024-06-03 20:13:11,287 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 77 selfloop transitions, 31 changer transitions 0/115 dead transitions. [2024-06-03 20:13:11,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 115 transitions, 1078 flow [2024-06-03 20:13:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-03 20:13:11,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-03 20:13:11,289 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 783 flow. Second operand 7 states and 134 transitions. [2024-06-03 20:13:11,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 115 transitions, 1078 flow [2024-06-03 20:13:11,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 115 transitions, 1044 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 20:13:11,296 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 821 flow [2024-06-03 20:13:11,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=821, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-06-03 20:13:11,297 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-03 20:13:11,297 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 821 flow [2024-06-03 20:13:11,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:11,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:11,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:11,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 20:13:11,297 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:11,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1877520580, now seen corresponding path program 1 times [2024-06-03 20:13:11,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943691233] [2024-06-03 20:13:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:13,119 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,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:13,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943691233] [2024-06-03 20:13:13,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943691233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:13,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:13:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431432155] [2024-06-03 20:13:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:13,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:13:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:13:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:13:13,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:13,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 821 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:14,313 INFO L124 PetriNetUnfolderBase]: 945/1534 cut-off events. [2024-06-03 20:13:14,313 INFO L125 PetriNetUnfolderBase]: For 4577/4590 co-relation queries the response was YES. [2024-06-03 20:13:14,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5610 conditions, 1534 events. 945/1534 cut-off events. For 4577/4590 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7549 event pairs, 320 based on Foata normal form. 4/1538 useless extension candidates. Maximal degree in co-relation 5565. Up to 1382 conditions per place. [2024-06-03 20:13:14,321 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 41 changer transitions 0/133 dead transitions. [2024-06-03 20:13:14,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 1293 flow [2024-06-03 20:13:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-03 20:13:14,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-03 20:13:14,323 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 821 flow. Second operand 7 states and 133 transitions. [2024-06-03 20:13:14,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 1293 flow [2024-06-03 20:13:14,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 133 transitions, 1209 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 20:13:14,329 INFO L231 Difference]: Finished difference. Result has 98 places, 112 transitions, 959 flow [2024-06-03 20:13:14,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=959, PETRI_PLACES=98, PETRI_TRANSITIONS=112} [2024-06-03 20:13:14,329 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-03 20:13:14,329 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 112 transitions, 959 flow [2024-06-03 20:13:14,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:14,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:14,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:14,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 20:13:14,330 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:14,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1670867140, now seen corresponding path program 2 times [2024-06-03 20:13:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164996949] [2024-06-03 20:13:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:16,196 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:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:16,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164996949] [2024-06-03 20:13:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164996949] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:13:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424714112] [2024-06-03 20:13:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:16,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:13:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:16,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:13:16,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:13:16,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:16,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 112 transitions, 959 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:16,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:16,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:16,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:17,370 INFO L124 PetriNetUnfolderBase]: 812/1303 cut-off events. [2024-06-03 20:13:17,370 INFO L125 PetriNetUnfolderBase]: For 5094/5103 co-relation queries the response was YES. [2024-06-03 20:13:17,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 1303 events. 812/1303 cut-off events. For 5094/5103 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6071 event pairs, 211 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 5141. Up to 1150 conditions per place. [2024-06-03 20:13:17,380 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 86 selfloop transitions, 42 changer transitions 0/134 dead transitions. [2024-06-03 20:13:17,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 134 transitions, 1359 flow [2024-06-03 20:13:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-03 20:13:17,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-03 20:13:17,381 INFO L175 Difference]: Start difference. First operand has 98 places, 112 transitions, 959 flow. Second operand 7 states and 129 transitions. [2024-06-03 20:13:17,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 134 transitions, 1359 flow [2024-06-03 20:13:17,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 134 transitions, 1292 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-06-03 20:13:17,393 INFO L231 Difference]: Finished difference. Result has 104 places, 116 transitions, 1041 flow [2024-06-03 20:13:17,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1041, PETRI_PLACES=104, PETRI_TRANSITIONS=116} [2024-06-03 20:13:17,393 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-03 20:13:17,394 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 116 transitions, 1041 flow [2024-06-03 20:13:17,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:17,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:17,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:17,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 20:13:17,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:17,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1671790630, now seen corresponding path program 3 times [2024-06-03 20:13:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488169019] [2024-06-03 20:13:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:19,218 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:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488169019] [2024-06-03 20:13:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488169019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:13:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119599242] [2024-06-03 20:13:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:19,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:13:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:13:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:13:19,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:19,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 116 transitions, 1041 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:19,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:19,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:19,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:20,279 INFO L124 PetriNetUnfolderBase]: 808/1295 cut-off events. [2024-06-03 20:13:20,279 INFO L125 PetriNetUnfolderBase]: For 5334/5343 co-relation queries the response was YES. [2024-06-03 20:13:20,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 1295 events. 808/1295 cut-off events. For 5334/5343 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6006 event pairs, 216 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 5170. Up to 1147 conditions per place. [2024-06-03 20:13:20,286 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 80 selfloop transitions, 46 changer transitions 0/132 dead transitions. [2024-06-03 20:13:20,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 1390 flow [2024-06-03 20:13:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-03 20:13:20,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-03 20:13:20,288 INFO L175 Difference]: Start difference. First operand has 104 places, 116 transitions, 1041 flow. Second operand 7 states and 125 transitions. [2024-06-03 20:13:20,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 1390 flow [2024-06-03 20:13:20,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 132 transitions, 1242 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-03 20:13:20,295 INFO L231 Difference]: Finished difference. Result has 105 places, 119 transitions, 1033 flow [2024-06-03 20:13:20,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1033, PETRI_PLACES=105, PETRI_TRANSITIONS=119} [2024-06-03 20:13:20,296 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-03 20:13:20,296 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 119 transitions, 1033 flow [2024-06-03 20:13:20,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:20,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:20,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:20,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 20:13:20,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:20,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1706637172, now seen corresponding path program 1 times [2024-06-03 20:13:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905344950] [2024-06-03 20:13:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:22,670 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,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905344950] [2024-06-03 20:13:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905344950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:13:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439337804] [2024-06-03 20:13:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:22,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:13:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:13:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:13:22,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:22,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 119 transitions, 1033 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:22,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:22,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:23,473 INFO L124 PetriNetUnfolderBase]: 811/1305 cut-off events. [2024-06-03 20:13:23,473 INFO L125 PetriNetUnfolderBase]: For 5400/5409 co-relation queries the response was YES. [2024-06-03 20:13:23,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 1305 events. 811/1305 cut-off events. For 5400/5409 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6145 event pairs, 379 based on Foata normal form. 2/1307 useless extension candidates. Maximal degree in co-relation 5190. Up to 1247 conditions per place. [2024-06-03 20:13:23,481 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 101 selfloop transitions, 18 changer transitions 0/125 dead transitions. [2024-06-03 20:13:23,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 125 transitions, 1305 flow [2024-06-03 20:13:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-03 20:13:23,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40069686411149824 [2024-06-03 20:13:23,483 INFO L175 Difference]: Start difference. First operand has 105 places, 119 transitions, 1033 flow. Second operand 7 states and 115 transitions. [2024-06-03 20:13:23,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 125 transitions, 1305 flow [2024-06-03 20:13:23,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 125 transitions, 1227 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:23,492 INFO L231 Difference]: Finished difference. Result has 108 places, 121 transitions, 1022 flow [2024-06-03 20:13:23,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1022, PETRI_PLACES=108, PETRI_TRANSITIONS=121} [2024-06-03 20:13:23,492 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-06-03 20:13:23,492 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 121 transitions, 1022 flow [2024-06-03 20:13:23,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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:23,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:23,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:23,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 20:13:23,493 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:23,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1670628502, now seen corresponding path program 2 times [2024-06-03 20:13:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224405919] [2024-06-03 20:13:23,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:26,274 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,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:26,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224405919] [2024-06-03 20:13:26,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224405919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:26,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:26,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358731076] [2024-06-03 20:13:26,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:26,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:26,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:26,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:26,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:26,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 121 transitions, 1022 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:26,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:26,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:27,283 INFO L124 PetriNetUnfolderBase]: 814/1312 cut-off events. [2024-06-03 20:13:27,284 INFO L125 PetriNetUnfolderBase]: For 5887/5898 co-relation queries the response was YES. [2024-06-03 20:13:27,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1312 events. 814/1312 cut-off events. For 5887/5898 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6174 event pairs, 353 based on Foata normal form. 2/1314 useless extension candidates. Maximal degree in co-relation 5244. Up to 1232 conditions per place. [2024-06-03 20:13:27,290 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 99 selfloop transitions, 25 changer transitions 0/130 dead transitions. [2024-06-03 20:13:27,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 130 transitions, 1318 flow [2024-06-03 20:13:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-03 20:13:27,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42160278745644597 [2024-06-03 20:13:27,292 INFO L175 Difference]: Start difference. First operand has 108 places, 121 transitions, 1022 flow. Second operand 7 states and 121 transitions. [2024-06-03 20:13:27,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 130 transitions, 1318 flow [2024-06-03 20:13:27,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 130 transitions, 1263 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:13:27,300 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 1052 flow [2024-06-03 20:13:27,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2024-06-03 20:13:27,301 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-03 20:13:27,301 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 1052 flow [2024-06-03 20:13:27,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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:27,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:27,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 20:13:27,302 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:27,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1670590372, now seen corresponding path program 3 times [2024-06-03 20:13:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164128368] [2024-06-03 20:13:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:30,041 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,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164128368] [2024-06-03 20:13:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164128368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:30,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 20:13:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001813493] [2024-06-03 20:13:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:30,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 20:13:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 20:13:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 20:13:30,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:30,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 1052 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:30,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:30,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:31,160 INFO L124 PetriNetUnfolderBase]: 811/1308 cut-off events. [2024-06-03 20:13:31,161 INFO L125 PetriNetUnfolderBase]: For 6386/6397 co-relation queries the response was YES. [2024-06-03 20:13:31,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5357 conditions, 1308 events. 811/1308 cut-off events. For 6386/6397 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6153 event pairs, 340 based on Foata normal form. 2/1310 useless extension candidates. Maximal degree in co-relation 5307. Up to 1202 conditions per place. [2024-06-03 20:13:31,167 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 103 selfloop transitions, 28 changer transitions 0/137 dead transitions. [2024-06-03 20:13:31,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 137 transitions, 1406 flow [2024-06-03 20:13:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-03 20:13:31,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-03 20:13:31,170 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 1052 flow. Second operand 7 states and 124 transitions. [2024-06-03 20:13:31,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 137 transitions, 1406 flow [2024-06-03 20:13:31,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 1337 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-03 20:13:31,179 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 1124 flow [2024-06-03 20:13:31,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1124, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2024-06-03 20:13:31,180 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-03 20:13:31,180 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 1124 flow [2024-06-03 20:13:31,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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:31,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:31,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 20:13:31,181 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:31,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash -803856269, now seen corresponding path program 1 times [2024-06-03 20:13:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:31,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381639857] [2024-06-03 20:13:31,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:31,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:32,764 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:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:32,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381639857] [2024-06-03 20:13:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381639857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153939496] [2024-06-03 20:13:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:32,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:32,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:32,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:32,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:32,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 1124 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:32,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:32,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:32,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:33,795 INFO L124 PetriNetUnfolderBase]: 1171/1805 cut-off events. [2024-06-03 20:13:33,796 INFO L125 PetriNetUnfolderBase]: For 8518/8529 co-relation queries the response was YES. [2024-06-03 20:13:33,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7388 conditions, 1805 events. 1171/1805 cut-off events. For 8518/8529 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8603 event pairs, 593 based on Foata normal form. 6/1808 useless extension candidates. Maximal degree in co-relation 7336. Up to 1710 conditions per place. [2024-06-03 20:13:33,805 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 104 selfloop transitions, 37 changer transitions 0/147 dead transitions. [2024-06-03 20:13:33,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 147 transitions, 1568 flow [2024-06-03 20:13:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 20:13:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 20:13:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-03 20:13:33,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-03 20:13:33,807 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 1124 flow. Second operand 7 states and 128 transitions. [2024-06-03 20:13:33,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 147 transitions, 1568 flow [2024-06-03 20:13:33,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 147 transitions, 1495 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-03 20:13:33,820 INFO L231 Difference]: Finished difference. Result has 119 places, 140 transitions, 1302 flow [2024-06-03 20:13:33,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1302, PETRI_PLACES=119, PETRI_TRANSITIONS=140} [2024-06-03 20:13:33,821 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-03 20:13:33,821 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 140 transitions, 1302 flow [2024-06-03 20:13:33,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:33,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:33,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:33,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 20:13:33,822 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:33,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:33,822 INFO L85 PathProgramCache]: Analyzing trace with hash -804244079, now seen corresponding path program 2 times [2024-06-03 20:13:33,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:33,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401972484] [2024-06-03 20:13:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:35,458 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:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401972484] [2024-06-03 20:13:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401972484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868234761] [2024-06-03 20:13:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:35,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:35,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:35,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 140 transitions, 1302 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:35,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:35,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:35,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:36,497 INFO L124 PetriNetUnfolderBase]: 1177/1817 cut-off events. [2024-06-03 20:13:36,498 INFO L125 PetriNetUnfolderBase]: For 10700/10711 co-relation queries the response was YES. [2024-06-03 20:13:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 1817 events. 1177/1817 cut-off events. For 10700/10711 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8740 event pairs, 592 based on Foata normal form. 10/1823 useless extension candidates. Maximal degree in co-relation 8110. Up to 1714 conditions per place. [2024-06-03 20:13:36,508 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 102 selfloop transitions, 52 changer transitions 0/160 dead transitions. [2024-06-03 20:13:36,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 160 transitions, 1817 flow [2024-06-03 20:13:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:13:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:13:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-03 20:13:36,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-03 20:13:36,510 INFO L175 Difference]: Start difference. First operand has 119 places, 140 transitions, 1302 flow. Second operand 8 states and 139 transitions. [2024-06-03 20:13:36,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 160 transitions, 1817 flow [2024-06-03 20:13:36,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 160 transitions, 1739 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-03 20:13:36,526 INFO L231 Difference]: Finished difference. Result has 125 places, 154 transitions, 1539 flow [2024-06-03 20:13:36,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1539, PETRI_PLACES=125, PETRI_TRANSITIONS=154} [2024-06-03 20:13:36,527 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 83 predicate places. [2024-06-03 20:13:36,527 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 154 transitions, 1539 flow [2024-06-03 20:13:36,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:36,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:36,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:36,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 20:13:36,528 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:36,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash -803641005, now seen corresponding path program 1 times [2024-06-03 20:13:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221200127] [2024-06-03 20:13:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:13:38,150 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:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:13:38,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221200127] [2024-06-03 20:13:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221200127] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:13:38,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:13:38,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:13:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362434434] [2024-06-03 20:13:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:13:38,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:13:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:13:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:13:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:13:38,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-03 20:13:38,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 154 transitions, 1539 flow. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:38,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:13:38,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-03 20:13:38,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:13:39,172 INFO L124 PetriNetUnfolderBase]: 1173/1813 cut-off events. [2024-06-03 20:13:39,172 INFO L125 PetriNetUnfolderBase]: For 13465/13552 co-relation queries the response was YES. [2024-06-03 20:13:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8712 conditions, 1813 events. 1173/1813 cut-off events. For 13465/13552 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8651 event pairs, 548 based on Foata normal form. 2/1811 useless extension candidates. Maximal degree in co-relation 8654. Up to 1741 conditions per place. [2024-06-03 20:13:39,184 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 132 selfloop transitions, 25 changer transitions 0/163 dead transitions. [2024-06-03 20:13:39,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 163 transitions, 1910 flow [2024-06-03 20:13:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:13:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:13:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-03 20:13:39,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-03 20:13:39,185 INFO L175 Difference]: Start difference. First operand has 125 places, 154 transitions, 1539 flow. Second operand 6 states and 108 transitions. [2024-06-03 20:13:39,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 163 transitions, 1910 flow [2024-06-03 20:13:39,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 163 transitions, 1798 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-03 20:13:39,204 INFO L231 Difference]: Finished difference. Result has 128 places, 158 transitions, 1540 flow [2024-06-03 20:13:39,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1427, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1540, PETRI_PLACES=128, PETRI_TRANSITIONS=158} [2024-06-03 20:13:39,204 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-03 20:13:39,205 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 158 transitions, 1540 flow [2024-06-03 20:13:39,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:13:39,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:13:39,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:39,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 20:13:39,205 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:13:39,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:13:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash -804232175, now seen corresponding path program 1 times [2024-06-03 20:13:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:13:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200854902] [2024-06-03 20:13:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:13:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:13:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:13:39,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:13:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:13:39,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:13:39,264 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:13:39,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:13:39,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:13:39,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:13:39,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:13:39,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:13:39,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:13:39,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 20:13:39,269 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-06-03 20:13:39,274 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:13:39,274 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:13:39,310 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,316 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,317 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,319 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,320 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,323 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,323 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,323 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,323 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,323 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,323 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,324 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:13:39,326 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:13:39,337 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:13:39,337 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:13:39,337 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:13:39 BasicIcfg [2024-06-03 20:13:39,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:13:39,338 INFO L158 Benchmark]: Toolchain (without parser) took 59781.31ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 105.5MB in the beginning and 786.2MB in the end (delta: -680.7MB). Peak memory consumption was 273.3MB. Max. memory is 16.1GB. [2024-06-03 20:13:39,338 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 87.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:13:39,338 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:13:39,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.43ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 108.3MB in the end (delta: -2.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-06-03 20:13:39,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.44ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 105.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:13:39,339 INFO L158 Benchmark]: Boogie Preprocessor took 66.17ms. Allocated memory is still 153.1MB. Free memory was 105.1MB in the beginning and 99.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:13:39,339 INFO L158 Benchmark]: RCFGBuilder took 971.34ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 99.9MB in the beginning and 104.5MB in the end (delta: -4.6MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-06-03 20:13:39,339 INFO L158 Benchmark]: TraceAbstraction took 58063.74ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 104.5MB in the beginning and 786.2MB in the end (delta: -681.8MB). Peak memory consumption was 241.0MB. Max. memory is 16.1GB. [2024-06-03 20:13:39,340 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.13ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 87.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.43ms. Allocated memory is still 153.1MB. Free memory was 105.5MB in the beginning and 108.3MB in the end (delta: -2.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.44ms. Allocated memory is still 153.1MB. Free memory was 108.3MB in the beginning and 105.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.17ms. Allocated memory is still 153.1MB. Free memory was 105.1MB in the beginning and 99.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 971.34ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 99.9MB in the beginning and 104.5MB in the end (delta: -4.6MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58063.74ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 104.5MB in the beginning and 786.2MB in the end (delta: -681.8MB). Peak memory consumption was 241.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 855]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 //@ ghost multithreaded = 1; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t2270; [L852] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 x [L852] 0 x [L852] 0 x [L852] 0 x [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-2, t2270=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 __unbuffered_p2_EAX$read_delayed_var [L852] 0 x [L852] 0 x [L852] 0 x [L852] 0 x [L853] 0 pthread_t t2271; [L854] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 x [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-2, t2270=-1, t2271=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 __unbuffered_p2_EAX$read_delayed_var [L854] 0 x [L854] 0 x [L854] 0 x [L854] 0 x [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 1)) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 1)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && ((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)))))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-2, t2270=-1, t2271=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 852]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 57.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 798 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3708 IncrementalHoareTripleChecker+Invalid, 3798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 51 mSDtfsCounter, 3708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1540occurred in iteration=21, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 29206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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:39,372 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