./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/protection/safe025_rmo.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i ./goblint.2024-05-07_14-17-48.files/protection/safe025_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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:41:26,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:41:26,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:41:26,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:41:26,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:41:26,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:41:26,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:41:26,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:41:26,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:41:26,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:41:26,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:41:26,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:41:26,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:41:26,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:41:26,853 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:41:26,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:41:26,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:41:26,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:41:26,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:41:26,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:41:26,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:41:26,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:41:26,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:41:26,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:41:26,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:41:26,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:41:26,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:41:26,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:41:26,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:41:26,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:41:26,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:41:26,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:41:26,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:41:26,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:41:26,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:41:26,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:41:26,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:41:26,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:41:26,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:41:26,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:41:26,860 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:41:26,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:41:26,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:41:26,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 13:41:27,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:41:27,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:41:27,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:41:27,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:41:27,156 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:41:27,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2024-05-12 13:41:28,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:41:28,521 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:41:28,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i [2024-05-12 13:41:28,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5edc3b7/ba4e464735084b798e9423e0f17edfec/FLAGc36bc2e96 [2024-05-12 13:41:28,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5edc3b7/ba4e464735084b798e9423e0f17edfec [2024-05-12 13:41:28,547 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:41:28,547 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:41:28,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/safe025_rmo.yml/witness.yml [2024-05-12 13:41:28,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:41:28,732 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:41:28,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:41:28,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:41:28,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:41:28,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:41:28" (1/2) ... [2024-05-12 13:41:28,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e846e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:41:28, skipping insertion in model container [2024-05-12 13:41:28,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:41:28" (1/2) ... [2024-05-12 13:41:28,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@fff7100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:41:28, skipping insertion in model container [2024-05-12 13:41:28,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:41:28" (2/2) ... [2024-05-12 13:41:28,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e846e30 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:28, skipping insertion in model container [2024-05-12 13:41:28,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:41:28" (2/2) ... [2024-05-12 13:41:28,743 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:41:28,849 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:41:28,850 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-05-12 13:41:28,851 INFO L97 edCorrectnessWitness]: Location invariant before [L860-L860] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-05-12 13:41:28,851 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] ((((((((((((((((((((((((((((((((((((! multithreaded || __unbuffered_p2_EAX$r_buff1_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$mem_tmp && x$mem_tmp <= 2) && x$mem_tmp <= 127) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || __unbuffered_p2_EAX$mem_tmp == 0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1 == 0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 2) && __unbuffered_p2_EAX <= 127) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$w_buff0 == 0)) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p2_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || (__unbuffered_p2_EAX$read_delayed_var == 0 || ((((0 <= *__unbuffered_p2_EAX$read_delayed_var && *__unbuffered_p2_EAX$read_delayed_var <= 2) && *__unbuffered_p2_EAX$read_delayed_var <= 127) && __unbuffered_p2_EAX$read_delayed_var == & x) && ((*__unbuffered_p2_EAX$read_delayed_var == 0 || *__unbuffered_p2_EAX$read_delayed_var == 1) || *__unbuffered_p2_EAX$read_delayed_var == 2))))) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || __unbuffered_p2_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0) [2024-05-12 13:41:28,851 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:41:28,851 INFO L106 edCorrectnessWitness]: ghost_update [L855-L855] multithreaded = 1; [2024-05-12 13:41:28,889 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:41:29,043 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i[988,1001] [2024-05-12 13:41:29,223 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:41:29,245 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 13:41:29,291 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_rmo.i[988,1001] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 13:41:29,395 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:41:29,422 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:41:29,422 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29 WrapperNode [2024-05-12 13:41:29,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:41:29,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:41:29,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:41:29,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:41:29,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,476 INFO L138 Inliner]: procedures = 176, calls = 120, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 283 [2024-05-12 13:41:29,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:41:29,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:41:29,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:41:29,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:41:29,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,596 INFO L175 MemorySlicer]: Split 69 memory accesses to 5 slices as follows [2, 64, 1, 1, 1]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 14 writes are split as follows [0, 11, 1, 1, 1]. [2024-05-12 13:41:29,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:41:29,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:41:29,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:41:29,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:41:29,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (1/1) ... [2024-05-12 13:41:29,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:41:29,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:41:29,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-05-12 13:41:29,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-05-12 13:41:29,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:41:29,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:41:29,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 13:41:29,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 13:41:29,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 13:41:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:41:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:41:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:41:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 13:41:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 13:41:29,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 13:41:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:41:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:41:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:41:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 13:41:29,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 13:41:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 13:41:29,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 13:41:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 13:41:29,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 13:41:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:41:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:41:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:41:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 13:41:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 13:41:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 13:41:29,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:41:29,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:41:29,745 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:41:29,913 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:41:29,915 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:41:30,514 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:41:30,514 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:41:30,904 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:41:30,905 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 13:41:30,905 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:41:30 BoogieIcfgContainer [2024-05-12 13:41:30,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:41:30,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:41:30,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:41:30,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:41:30,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:41:28" (1/4) ... [2024-05-12 13:41:30,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f09307e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:41:30, skipping insertion in model container [2024-05-12 13:41:30,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:41:28" (2/4) ... [2024-05-12 13:41:30,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f09307e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:41:30, skipping insertion in model container [2024-05-12 13:41:30,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:41:29" (3/4) ... [2024-05-12 13:41:30,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f09307e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:41:30, skipping insertion in model container [2024-05-12 13:41:30,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:41:30" (4/4) ... [2024-05-12 13:41:30,911 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_rmo.i [2024-05-12 13:41:30,927 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:41:30,927 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 13:41:30,927 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:41:30,998 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 13:41:31,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:41:31,043 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-05-12 13:41:31,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:41:31,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-05-12 13:41:31,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-05-12 13:41:31,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 41 transitions, 91 flow [2024-05-12 13:41:31,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:41:31,059 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;@668457fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:41:31,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 13:41:31,063 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:41:31,063 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 13:41:31,063 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:41:31,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:31,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:41:31,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:31,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1914076956, now seen corresponding path program 1 times [2024-05-12 13:41:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667996223] [2024-05-12 13:41:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667996223] [2024-05-12 13:41:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667996223] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:41:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389021224] [2024-05-12 13:41:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:33,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:41:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:41:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:41:33,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:41:33,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:33,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:33,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:41:33,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:34,428 INFO L124 PetriNetUnfolderBase]: 2933/4724 cut-off events. [2024-05-12 13:41:34,429 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-05-12 13:41:34,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9046 conditions, 4724 events. 2933/4724 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 27935 event pairs, 1804 based on Foata normal form. 0/4717 useless extension candidates. Maximal degree in co-relation 9031. Up to 4231 conditions per place. [2024-05-12 13:41:34,454 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 39 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2024-05-12 13:41:34,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 223 flow [2024-05-12 13:41:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:41:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:41:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-05-12 13:41:34,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 13:41:34,465 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 91 flow. Second operand 4 states and 104 transitions. [2024-05-12 13:41:34,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 223 flow [2024-05-12 13:41:34,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:34,469 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 142 flow [2024-05-12 13:41:34,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2024-05-12 13:41:34,473 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2024-05-12 13:41:34,473 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 142 flow [2024-05-12 13:41:34,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:34,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:34,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:34,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:41:34,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:34,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1182000379, now seen corresponding path program 1 times [2024-05-12 13:41:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562679599] [2024-05-12 13:41:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:36,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:36,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562679599] [2024-05-12 13:41:36,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562679599] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:36,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:36,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:41:36,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272571837] [2024-05-12 13:41:36,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:36,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:41:36,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:36,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:41:36,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:41:36,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:36,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:36,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:36,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:36,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:37,567 INFO L124 PetriNetUnfolderBase]: 3537/5470 cut-off events. [2024-05-12 13:41:37,567 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2024-05-12 13:41:37,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11669 conditions, 5470 events. 3537/5470 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31721 event pairs, 1528 based on Foata normal form. 0/5459 useless extension candidates. Maximal degree in co-relation 11653. Up to 5025 conditions per place. [2024-05-12 13:41:37,595 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 45 selfloop transitions, 16 changer transitions 0/70 dead transitions. [2024-05-12 13:41:37,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 326 flow [2024-05-12 13:41:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:41:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:41:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-05-12 13:41:37,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191489361702127 [2024-05-12 13:41:37,604 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 142 flow. Second operand 5 states and 122 transitions. [2024-05-12 13:41:37,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 326 flow [2024-05-12 13:41:37,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 326 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 13:41:37,607 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 234 flow [2024-05-12 13:41:37,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-05-12 13:41:37,608 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2024-05-12 13:41:37,608 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 234 flow [2024-05-12 13:41:37,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:37,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:37,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:37,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:41:37,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:37,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1183102429, now seen corresponding path program 2 times [2024-05-12 13:41:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614765955] [2024-05-12 13:41:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:37,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:39,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:39,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614765955] [2024-05-12 13:41:39,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614765955] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:39,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:39,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:41:39,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305862750] [2024-05-12 13:41:39,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:39,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 13:41:39,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:39,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 13:41:39,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:41:39,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:39,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:39,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:39,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:39,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:40,496 INFO L124 PetriNetUnfolderBase]: 3535/5476 cut-off events. [2024-05-12 13:41:40,497 INFO L125 PetriNetUnfolderBase]: For 2195/2199 co-relation queries the response was YES. [2024-05-12 13:41:40,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12738 conditions, 5476 events. 3535/5476 cut-off events. For 2195/2199 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 31625 event pairs, 1669 based on Foata normal form. 4/5478 useless extension candidates. Maximal degree in co-relation 12718. Up to 5024 conditions per place. [2024-05-12 13:41:40,529 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 54 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2024-05-12 13:41:40,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 418 flow [2024-05-12 13:41:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:41:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:41:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-05-12 13:41:40,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5617021276595745 [2024-05-12 13:41:40,533 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 234 flow. Second operand 5 states and 132 transitions. [2024-05-12 13:41:40,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 418 flow [2024-05-12 13:41:40,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 408 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-05-12 13:41:40,541 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 257 flow [2024-05-12 13:41:40,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-05-12 13:41:40,542 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2024-05-12 13:41:40,542 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 257 flow [2024-05-12 13:41:40,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:40,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:40,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:40,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:41:40,543 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:40,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2013238673, now seen corresponding path program 1 times [2024-05-12 13:41:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4280530] [2024-05-12 13:41:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:40,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:42,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4280530] [2024-05-12 13:41:42,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4280530] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:42,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:41:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141584937] [2024-05-12 13:41:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:42,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:41:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:42,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:41:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:41:42,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:41:42,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:42,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:42,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:41:42,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:43,395 INFO L124 PetriNetUnfolderBase]: 2985/4756 cut-off events. [2024-05-12 13:41:43,395 INFO L125 PetriNetUnfolderBase]: For 1235/1239 co-relation queries the response was YES. [2024-05-12 13:41:43,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10569 conditions, 4756 events. 2985/4756 cut-off events. For 1235/1239 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 27948 event pairs, 1674 based on Foata normal form. 0/4726 useless extension candidates. Maximal degree in co-relation 10546. Up to 4310 conditions per place. [2024-05-12 13:41:43,422 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 49 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2024-05-12 13:41:43,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 434 flow [2024-05-12 13:41:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:41:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:41:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-05-12 13:41:43,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929078014184397 [2024-05-12 13:41:43,424 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 257 flow. Second operand 6 states and 139 transitions. [2024-05-12 13:41:43,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 434 flow [2024-05-12 13:41:43,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 390 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 13:41:43,427 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 298 flow [2024-05-12 13:41:43,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2024-05-12 13:41:43,427 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2024-05-12 13:41:43,428 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 298 flow [2024-05-12 13:41:43,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:43,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:43,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:43,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 13:41:43,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:43,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1986629072, now seen corresponding path program 1 times [2024-05-12 13:41:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188348220] [2024-05-12 13:41:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188348220] [2024-05-12 13:41:45,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188348220] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425543796] [2024-05-12 13:41:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:45,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:45,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 298 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:45,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:45,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:45,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:46,825 INFO L124 PetriNetUnfolderBase]: 3603/5582 cut-off events. [2024-05-12 13:41:46,827 INFO L125 PetriNetUnfolderBase]: For 2278/2284 co-relation queries the response was YES. [2024-05-12 13:41:46,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13068 conditions, 5582 events. 3603/5582 cut-off events. For 2278/2284 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32250 event pairs, 1720 based on Foata normal form. 8/5588 useless extension candidates. Maximal degree in co-relation 13042. Up to 5118 conditions per place. [2024-05-12 13:41:46,848 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 60 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2024-05-12 13:41:46,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 92 transitions, 552 flow [2024-05-12 13:41:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 13:41:46,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075987841945289 [2024-05-12 13:41:46,850 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 298 flow. Second operand 7 states and 167 transitions. [2024-05-12 13:41:46,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 92 transitions, 552 flow [2024-05-12 13:41:46,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 548 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 13:41:46,855 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 410 flow [2024-05-12 13:41:46,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=410, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-05-12 13:41:46,857 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-05-12 13:41:46,857 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 410 flow [2024-05-12 13:41:46,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:46,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:46,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:46,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 13:41:46,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:46,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1987046642, now seen corresponding path program 2 times [2024-05-12 13:41:46,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:46,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439848796] [2024-05-12 13:41:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:46,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439848796] [2024-05-12 13:41:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439848796] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:48,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346944840] [2024-05-12 13:41:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:48,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:48,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:48,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 410 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:48,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:48,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:48,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:50,337 INFO L124 PetriNetUnfolderBase]: 3611/5586 cut-off events. [2024-05-12 13:41:50,337 INFO L125 PetriNetUnfolderBase]: For 4266/4272 co-relation queries the response was YES. [2024-05-12 13:41:50,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14284 conditions, 5586 events. 3611/5586 cut-off events. For 4266/4272 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32421 event pairs, 1552 based on Foata normal form. 10/5590 useless extension candidates. Maximal degree in co-relation 14253. Up to 5121 conditions per place. [2024-05-12 13:41:50,363 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 51 selfloop transitions, 33 changer transitions 0/93 dead transitions. [2024-05-12 13:41:50,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 93 transitions, 666 flow [2024-05-12 13:41:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:41:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:41:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-05-12 13:41:50,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2024-05-12 13:41:50,365 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 410 flow. Second operand 8 states and 176 transitions. [2024-05-12 13:41:50,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 93 transitions, 666 flow [2024-05-12 13:41:50,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 628 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 13:41:50,370 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 510 flow [2024-05-12 13:41:50,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2024-05-12 13:41:50,371 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2024-05-12 13:41:50,371 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 510 flow [2024-05-12 13:41:50,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:50,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:50,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:50,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 13:41:50,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:50,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1986413808, now seen corresponding path program 1 times [2024-05-12 13:41:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072932726] [2024-05-12 13:41:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072932726] [2024-05-12 13:41:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072932726] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635205250] [2024-05-12 13:41:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:52,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:52,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:52,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:52,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:41:52,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 510 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:52,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:52,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:41:52,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:53,932 INFO L124 PetriNetUnfolderBase]: 3011/4879 cut-off events. [2024-05-12 13:41:53,933 INFO L125 PetriNetUnfolderBase]: For 5986/5992 co-relation queries the response was YES. [2024-05-12 13:41:53,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13216 conditions, 4879 events. 3011/4879 cut-off events. For 5986/5992 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 28992 event pairs, 1564 based on Foata normal form. 3/4879 useless extension candidates. Maximal degree in co-relation 13183. Up to 4290 conditions per place. [2024-05-12 13:41:53,964 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 77 selfloop transitions, 27 changer transitions 0/114 dead transitions. [2024-05-12 13:41:53,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 885 flow [2024-05-12 13:41:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-05-12 13:41:53,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-05-12 13:41:53,967 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 510 flow. Second operand 7 states and 168 transitions. [2024-05-12 13:41:53,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 885 flow [2024-05-12 13:41:53,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 824 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-05-12 13:41:53,973 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 638 flow [2024-05-12 13:41:53,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=638, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2024-05-12 13:41:53,974 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2024-05-12 13:41:53,974 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 638 flow [2024-05-12 13:41:53,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:53,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:53,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:53,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:41:53,975 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:53,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1922421945, now seen corresponding path program 1 times [2024-05-12 13:41:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301657210] [2024-05-12 13:41:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:57,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301657210] [2024-05-12 13:41:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301657210] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:57,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:57,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:41:57,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401135717] [2024-05-12 13:41:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:57,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:41:57,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:57,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:41:57,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:41:57,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:41:57,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 638 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:57,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:57,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:41:57,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:41:58,212 INFO L124 PetriNetUnfolderBase]: 3599/5580 cut-off events. [2024-05-12 13:41:58,213 INFO L125 PetriNetUnfolderBase]: For 9156/9196 co-relation queries the response was YES. [2024-05-12 13:41:58,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16504 conditions, 5580 events. 3599/5580 cut-off events. For 9156/9196 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 32325 event pairs, 1453 based on Foata normal form. 4/5569 useless extension candidates. Maximal degree in co-relation 16467. Up to 5112 conditions per place. [2024-05-12 13:41:58,286 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 75 selfloop transitions, 24 changer transitions 0/108 dead transitions. [2024-05-12 13:41:58,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 886 flow [2024-05-12 13:41:58,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:41:58,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:41:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-05-12 13:41:58,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45592705167173253 [2024-05-12 13:41:58,287 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 638 flow. Second operand 7 states and 150 transitions. [2024-05-12 13:41:58,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 886 flow [2024-05-12 13:41:58,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 108 transitions, 846 flow, removed 19 selfloop flow, removed 1 redundant places. [2024-05-12 13:41:58,298 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 675 flow [2024-05-12 13:41:58,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2024-05-12 13:41:58,299 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2024-05-12 13:41:58,299 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 675 flow [2024-05-12 13:41:58,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:58,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:41:58,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:41:58,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 13:41:58,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:41:58,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:41:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1469030453, now seen corresponding path program 1 times [2024-05-12 13:41:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:41:58,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276197976] [2024-05-12 13:41:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:41:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:41:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:41:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:41:59,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:41:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276197976] [2024-05-12 13:41:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276197976] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:41:59,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:41:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 13:41:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338588405] [2024-05-12 13:41:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:41:59,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:41:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:41:59,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:41:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:41:59,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:41:59,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 675 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:41:59,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:41:59,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:41:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:01,059 INFO L124 PetriNetUnfolderBase]: 3368/5412 cut-off events. [2024-05-12 13:42:01,059 INFO L125 PetriNetUnfolderBase]: For 9318/9364 co-relation queries the response was YES. [2024-05-12 13:42:01,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15920 conditions, 5412 events. 3368/5412 cut-off events. For 9318/9364 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 32538 event pairs, 2018 based on Foata normal form. 0/5253 useless extension candidates. Maximal degree in co-relation 15880. Up to 4845 conditions per place. [2024-05-12 13:42:01,093 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 86 selfloop transitions, 20 changer transitions 0/116 dead transitions. [2024-05-12 13:42:01,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 116 transitions, 992 flow [2024-05-12 13:42:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:42:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:42:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 13:42:01,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 13:42:01,095 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 675 flow. Second operand 6 states and 141 transitions. [2024-05-12 13:42:01,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 116 transitions, 992 flow [2024-05-12 13:42:01,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 116 transitions, 936 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 13:42:01,107 INFO L231 Difference]: Finished difference. Result has 98 places, 109 transitions, 783 flow [2024-05-12 13:42:01,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=98, PETRI_TRANSITIONS=109} [2024-05-12 13:42:01,107 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2024-05-12 13:42:01,108 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 109 transitions, 783 flow [2024-05-12 13:42:01,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:01,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:01,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:01,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 13:42:01,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:01,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1449263145, now seen corresponding path program 1 times [2024-05-12 13:42:01,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633734498] [2024-05-12 13:42:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:03,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633734498] [2024-05-12 13:42:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633734498] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:03,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712439384] [2024-05-12 13:42:03,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:03,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:03,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:42:03,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 109 transitions, 783 flow. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:03,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:03,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:42:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:04,707 INFO L124 PetriNetUnfolderBase]: 3097/5052 cut-off events. [2024-05-12 13:42:04,707 INFO L125 PetriNetUnfolderBase]: For 9619/9633 co-relation queries the response was YES. [2024-05-12 13:42:04,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15417 conditions, 5052 events. 3097/5052 cut-off events. For 9619/9633 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 30737 event pairs, 1746 based on Foata normal form. 8/5052 useless extension candidates. Maximal degree in co-relation 15373. Up to 4437 conditions per place. [2024-05-12 13:42:04,738 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 87 selfloop transitions, 33 changer transitions 0/130 dead transitions. [2024-05-12 13:42:04,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 130 transitions, 1119 flow [2024-05-12 13:42:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:42:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:42:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-05-12 13:42:04,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5283687943262412 [2024-05-12 13:42:04,740 INFO L175 Difference]: Start difference. First operand has 98 places, 109 transitions, 783 flow. Second operand 6 states and 149 transitions. [2024-05-12 13:42:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 130 transitions, 1119 flow [2024-05-12 13:42:04,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 130 transitions, 1099 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-05-12 13:42:04,753 INFO L231 Difference]: Finished difference. Result has 104 places, 113 transitions, 896 flow [2024-05-12 13:42:04,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=104, PETRI_TRANSITIONS=113} [2024-05-12 13:42:04,754 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2024-05-12 13:42:04,754 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 113 transitions, 896 flow [2024-05-12 13:42:04,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:04,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:04,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:04,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 13:42:04,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:04,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1396025653, now seen corresponding path program 2 times [2024-05-12 13:42:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515889587] [2024-05-12 13:42:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:08,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515889587] [2024-05-12 13:42:08,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515889587] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:08,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19875978] [2024-05-12 13:42:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:08,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:08,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 113 transitions, 896 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:08,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:08,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:08,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:09,471 INFO L124 PetriNetUnfolderBase]: 3811/5948 cut-off events. [2024-05-12 13:42:09,472 INFO L125 PetriNetUnfolderBase]: For 11335/11382 co-relation queries the response was YES. [2024-05-12 13:42:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18397 conditions, 5948 events. 3811/5948 cut-off events. For 11335/11382 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35262 event pairs, 1650 based on Foata normal form. 2/5940 useless extension candidates. Maximal degree in co-relation 18349. Up to 5465 conditions per place. [2024-05-12 13:42:09,506 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 106 selfloop transitions, 32 changer transitions 0/147 dead transitions. [2024-05-12 13:42:09,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 147 transitions, 1351 flow [2024-05-12 13:42:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 13:42:09,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258358662613982 [2024-05-12 13:42:09,508 INFO L175 Difference]: Start difference. First operand has 104 places, 113 transitions, 896 flow. Second operand 7 states and 173 transitions. [2024-05-12 13:42:09,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 147 transitions, 1351 flow [2024-05-12 13:42:09,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 147 transitions, 1257 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-05-12 13:42:09,522 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 997 flow [2024-05-12 13:42:09,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=997, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2024-05-12 13:42:09,523 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 59 predicate places. [2024-05-12 13:42:09,523 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 997 flow [2024-05-12 13:42:09,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:09,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:09,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:09,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 13:42:09,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:09,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1781490843, now seen corresponding path program 3 times [2024-05-12 13:42:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:09,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985261103] [2024-05-12 13:42:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985261103] [2024-05-12 13:42:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985261103] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566713578] [2024-05-12 13:42:12,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:12,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:12,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:12,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 997 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:12,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:12,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:12,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:13,814 INFO L124 PetriNetUnfolderBase]: 3812/5957 cut-off events. [2024-05-12 13:42:13,814 INFO L125 PetriNetUnfolderBase]: For 12593/12688 co-relation queries the response was YES. [2024-05-12 13:42:13,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18719 conditions, 5957 events. 3812/5957 cut-off events. For 12593/12688 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35265 event pairs, 1635 based on Foata normal form. 2/5948 useless extension candidates. Maximal degree in co-relation 18669. Up to 5474 conditions per place. [2024-05-12 13:42:13,860 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 96 selfloop transitions, 34 changer transitions 0/139 dead transitions. [2024-05-12 13:42:13,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 1326 flow [2024-05-12 13:42:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-05-12 13:42:13,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49240121580547114 [2024-05-12 13:42:13,862 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 997 flow. Second operand 7 states and 162 transitions. [2024-05-12 13:42:13,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 1326 flow [2024-05-12 13:42:13,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 139 transitions, 1280 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-05-12 13:42:13,880 INFO L231 Difference]: Finished difference. Result has 116 places, 126 transitions, 1064 flow [2024-05-12 13:42:13,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1064, PETRI_PLACES=116, PETRI_TRANSITIONS=126} [2024-05-12 13:42:13,881 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 65 predicate places. [2024-05-12 13:42:13,881 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 126 transitions, 1064 flow [2024-05-12 13:42:13,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:13,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:13,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:13,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 13:42:13,882 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:13,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1395986593, now seen corresponding path program 4 times [2024-05-12 13:42:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792157381] [2024-05-12 13:42:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792157381] [2024-05-12 13:42:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792157381] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:16,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919354727] [2024-05-12 13:42:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:16,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:16,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:16,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 126 transitions, 1064 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:16,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:16,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:16,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:18,439 INFO L124 PetriNetUnfolderBase]: 3811/5952 cut-off events. [2024-05-12 13:42:18,439 INFO L125 PetriNetUnfolderBase]: For 11673/11744 co-relation queries the response was YES. [2024-05-12 13:42:18,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18407 conditions, 5952 events. 3811/5952 cut-off events. For 11673/11744 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35439 event pairs, 1205 based on Foata normal form. 2/5944 useless extension candidates. Maximal degree in co-relation 18355. Up to 5408 conditions per place. [2024-05-12 13:42:18,476 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 116 selfloop transitions, 35 changer transitions 0/160 dead transitions. [2024-05-12 13:42:18,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 160 transitions, 1493 flow [2024-05-12 13:42:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-05-12 13:42:18,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5531914893617021 [2024-05-12 13:42:18,478 INFO L175 Difference]: Start difference. First operand has 116 places, 126 transitions, 1064 flow. Second operand 7 states and 182 transitions. [2024-05-12 13:42:18,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 160 transitions, 1493 flow [2024-05-12 13:42:18,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 160 transitions, 1399 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-05-12 13:42:18,494 INFO L231 Difference]: Finished difference. Result has 115 places, 128 transitions, 1059 flow [2024-05-12 13:42:18,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1059, PETRI_PLACES=115, PETRI_TRANSITIONS=128} [2024-05-12 13:42:18,495 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2024-05-12 13:42:18,495 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 128 transitions, 1059 flow [2024-05-12 13:42:18,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:18,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:18,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:18,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 13:42:18,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:18,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:18,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2110576273, now seen corresponding path program 1 times [2024-05-12 13:42:18,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:18,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597137111] [2024-05-12 13:42:18,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:18,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597137111] [2024-05-12 13:42:20,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597137111] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:20,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:42:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521852226] [2024-05-12 13:42:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:20,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:42:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:42:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:42:20,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:20,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 128 transitions, 1059 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:20,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:20,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:20,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:22,647 INFO L124 PetriNetUnfolderBase]: 3854/6021 cut-off events. [2024-05-12 13:42:22,648 INFO L125 PetriNetUnfolderBase]: For 13688/13696 co-relation queries the response was YES. [2024-05-12 13:42:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19372 conditions, 6021 events. 3854/6021 cut-off events. For 13688/13696 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35918 event pairs, 1276 based on Foata normal form. 3/6024 useless extension candidates. Maximal degree in co-relation 19322. Up to 5373 conditions per place. [2024-05-12 13:42:22,695 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 115 selfloop transitions, 58 changer transitions 0/181 dead transitions. [2024-05-12 13:42:22,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 181 transitions, 1712 flow [2024-05-12 13:42:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:42:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:42:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2024-05-12 13:42:22,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2024-05-12 13:42:22,698 INFO L175 Difference]: Start difference. First operand has 115 places, 128 transitions, 1059 flow. Second operand 8 states and 194 transitions. [2024-05-12 13:42:22,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 181 transitions, 1712 flow [2024-05-12 13:42:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 181 transitions, 1615 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-05-12 13:42:22,721 INFO L231 Difference]: Finished difference. Result has 118 places, 147 transitions, 1304 flow [2024-05-12 13:42:22,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1304, PETRI_PLACES=118, PETRI_TRANSITIONS=147} [2024-05-12 13:42:22,722 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2024-05-12 13:42:22,722 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 1304 flow [2024-05-12 13:42:22,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:22,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:22,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 13:42:22,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:22,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1977737583, now seen corresponding path program 2 times [2024-05-12 13:42:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:22,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131491934] [2024-05-12 13:42:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131491934] [2024-05-12 13:42:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131491934] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:42:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897128456] [2024-05-12 13:42:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:24,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:42:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:42:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:42:24,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:24,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 1304 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:24,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:24,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:24,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:26,792 INFO L124 PetriNetUnfolderBase]: 3802/5934 cut-off events. [2024-05-12 13:42:26,792 INFO L125 PetriNetUnfolderBase]: For 19175/19181 co-relation queries the response was YES. [2024-05-12 13:42:26,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20833 conditions, 5934 events. 3802/5934 cut-off events. For 19175/19181 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 35197 event pairs, 1288 based on Foata normal form. 3/5936 useless extension candidates. Maximal degree in co-relation 20781. Up to 5283 conditions per place. [2024-05-12 13:42:26,833 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 124 selfloop transitions, 63 changer transitions 0/195 dead transitions. [2024-05-12 13:42:26,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 195 transitions, 2032 flow [2024-05-12 13:42:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:42:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:42:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-05-12 13:42:26,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053191489361702 [2024-05-12 13:42:26,835 INFO L175 Difference]: Start difference. First operand has 118 places, 147 transitions, 1304 flow. Second operand 8 states and 190 transitions. [2024-05-12 13:42:26,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 195 transitions, 2032 flow [2024-05-12 13:42:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 195 transitions, 1922 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-05-12 13:42:26,873 INFO L231 Difference]: Finished difference. Result has 126 places, 159 transitions, 1491 flow [2024-05-12 13:42:26,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1491, PETRI_PLACES=126, PETRI_TRANSITIONS=159} [2024-05-12 13:42:26,874 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 75 predicate places. [2024-05-12 13:42:26,875 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 1491 flow [2024-05-12 13:42:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:26,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:26,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:26,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 13:42:26,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:26,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1978155153, now seen corresponding path program 3 times [2024-05-12 13:42:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117725460] [2024-05-12 13:42:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:29,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117725460] [2024-05-12 13:42:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117725460] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:42:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931046897] [2024-05-12 13:42:29,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:29,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:42:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:29,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:42:29,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:42:29,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:29,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 159 transitions, 1491 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:29,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:29,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:31,495 INFO L124 PetriNetUnfolderBase]: 3804/5936 cut-off events. [2024-05-12 13:42:31,496 INFO L125 PetriNetUnfolderBase]: For 20394/20400 co-relation queries the response was YES. [2024-05-12 13:42:31,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21097 conditions, 5936 events. 3804/5936 cut-off events. For 20394/20400 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 35162 event pairs, 1289 based on Foata normal form. 3/5938 useless extension candidates. Maximal degree in co-relation 21041. Up to 5285 conditions per place. [2024-05-12 13:42:31,531 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 112 selfloop transitions, 73 changer transitions 0/193 dead transitions. [2024-05-12 13:42:31,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 193 transitions, 2119 flow [2024-05-12 13:42:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 13:42:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 13:42:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2024-05-12 13:42:31,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47044917257683216 [2024-05-12 13:42:31,533 INFO L175 Difference]: Start difference. First operand has 126 places, 159 transitions, 1491 flow. Second operand 9 states and 199 transitions. [2024-05-12 13:42:31,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 193 transitions, 2119 flow [2024-05-12 13:42:31,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 193 transitions, 2006 flow, removed 44 selfloop flow, removed 2 redundant places. [2024-05-12 13:42:31,566 INFO L231 Difference]: Finished difference. Result has 134 places, 165 transitions, 1638 flow [2024-05-12 13:42:31,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1638, PETRI_PLACES=134, PETRI_TRANSITIONS=165} [2024-05-12 13:42:31,567 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 83 predicate places. [2024-05-12 13:42:31,567 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 165 transitions, 1638 flow [2024-05-12 13:42:31,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:31,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:31,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:31,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 13:42:31,568 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:31,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1284793962, now seen corresponding path program 1 times [2024-05-12 13:42:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823439309] [2024-05-12 13:42:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823439309] [2024-05-12 13:42:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823439309] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:33,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:33,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815984068] [2024-05-12 13:42:33,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:33,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:33,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:33,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 165 transitions, 1638 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:33,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:33,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:33,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:35,211 INFO L124 PetriNetUnfolderBase]: 4113/6320 cut-off events. [2024-05-12 13:42:35,211 INFO L125 PetriNetUnfolderBase]: For 22172/22219 co-relation queries the response was YES. [2024-05-12 13:42:35,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22898 conditions, 6320 events. 4113/6320 cut-off events. For 22172/22219 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 36964 event pairs, 1667 based on Foata normal form. 8/6322 useless extension candidates. Maximal degree in co-relation 22838. Up to 5827 conditions per place. [2024-05-12 13:42:35,251 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 145 selfloop transitions, 44 changer transitions 0/197 dead transitions. [2024-05-12 13:42:35,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 197 transitions, 2277 flow [2024-05-12 13:42:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-05-12 13:42:35,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513677811550152 [2024-05-12 13:42:35,255 INFO L175 Difference]: Start difference. First operand has 134 places, 165 transitions, 1638 flow. Second operand 7 states and 169 transitions. [2024-05-12 13:42:35,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 197 transitions, 2277 flow [2024-05-12 13:42:35,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 197 transitions, 2077 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-05-12 13:42:35,296 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1778 flow [2024-05-12 13:42:35,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1778, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2024-05-12 13:42:35,297 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 87 predicate places. [2024-05-12 13:42:35,297 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1778 flow [2024-05-12 13:42:35,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:35,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:35,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 13:42:35,298 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:35,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1003377782, now seen corresponding path program 1 times [2024-05-12 13:42:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577115736] [2024-05-12 13:42:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577115736] [2024-05-12 13:42:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577115736] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:37,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:42:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386682410] [2024-05-12 13:42:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:37,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:42:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:42:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:42:37,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:37,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1778 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:37,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:37,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:37,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:39,351 INFO L124 PetriNetUnfolderBase]: 4004/6245 cut-off events. [2024-05-12 13:42:39,351 INFO L125 PetriNetUnfolderBase]: For 28768/28954 co-relation queries the response was YES. [2024-05-12 13:42:39,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24356 conditions, 6245 events. 4004/6245 cut-off events. For 28768/28954 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37197 event pairs, 1408 based on Foata normal form. 6/6196 useless extension candidates. Maximal degree in co-relation 24293. Up to 5498 conditions per place. [2024-05-12 13:42:39,395 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 141 selfloop transitions, 83 changer transitions 0/232 dead transitions. [2024-05-12 13:42:39,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 232 transitions, 2618 flow [2024-05-12 13:42:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-05-12 13:42:39,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2024-05-12 13:42:39,405 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1778 flow. Second operand 7 states and 178 transitions. [2024-05-12 13:42:39,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 232 transitions, 2618 flow [2024-05-12 13:42:39,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 232 transitions, 2518 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-05-12 13:42:39,460 INFO L231 Difference]: Finished difference. Result has 143 places, 193 transitions, 2044 flow [2024-05-12 13:42:39,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2044, PETRI_PLACES=143, PETRI_TRANSITIONS=193} [2024-05-12 13:42:39,461 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 92 predicate places. [2024-05-12 13:42:39,461 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 193 transitions, 2044 flow [2024-05-12 13:42:39,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:39,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:39,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:39,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 13:42:39,462 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:39,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:39,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1306042602, now seen corresponding path program 2 times [2024-05-12 13:42:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636845572] [2024-05-12 13:42:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:41,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636845572] [2024-05-12 13:42:41,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636845572] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:41,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:41,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223915251] [2024-05-12 13:42:41,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:41,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:41,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:41,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:41,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:41,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:41,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 193 transitions, 2044 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:41,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:41,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:41,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:43,180 INFO L124 PetriNetUnfolderBase]: 4194/6439 cut-off events. [2024-05-12 13:42:43,180 INFO L125 PetriNetUnfolderBase]: For 30461/30468 co-relation queries the response was YES. [2024-05-12 13:42:43,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25578 conditions, 6439 events. 4194/6439 cut-off events. For 30461/30468 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 37697 event pairs, 1688 based on Foata normal form. 13/6444 useless extension candidates. Maximal degree in co-relation 25513. Up to 5926 conditions per place. [2024-05-12 13:42:43,234 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 151 selfloop transitions, 69 changer transitions 0/228 dead transitions. [2024-05-12 13:42:43,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 228 transitions, 2884 flow [2024-05-12 13:42:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 13:42:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 13:42:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-05-12 13:42:43,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2024-05-12 13:42:43,236 INFO L175 Difference]: Start difference. First operand has 143 places, 193 transitions, 2044 flow. Second operand 8 states and 180 transitions. [2024-05-12 13:42:43,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 228 transitions, 2884 flow [2024-05-12 13:42:43,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 228 transitions, 2713 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-05-12 13:42:43,305 INFO L231 Difference]: Finished difference. Result has 149 places, 213 transitions, 2354 flow [2024-05-12 13:42:43,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2354, PETRI_PLACES=149, PETRI_TRANSITIONS=213} [2024-05-12 13:42:43,306 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 98 predicate places. [2024-05-12 13:42:43,306 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 213 transitions, 2354 flow [2024-05-12 13:42:43,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:43,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:43,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:43,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 13:42:43,307 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:43,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 278926034, now seen corresponding path program 2 times [2024-05-12 13:42:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002627449] [2024-05-12 13:42:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:45,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002627449] [2024-05-12 13:42:45,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002627449] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:45,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:45,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:42:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463538324] [2024-05-12 13:42:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:45,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:42:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:42:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:42:45,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:45,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 213 transitions, 2354 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:45,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:45,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:45,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:47,557 INFO L124 PetriNetUnfolderBase]: 4023/6246 cut-off events. [2024-05-12 13:42:47,557 INFO L125 PetriNetUnfolderBase]: For 37167/37462 co-relation queries the response was YES. [2024-05-12 13:42:47,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25947 conditions, 6246 events. 4023/6246 cut-off events. For 37167/37462 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37116 event pairs, 1402 based on Foata normal form. 16/6196 useless extension candidates. Maximal degree in co-relation 25880. Up to 5507 conditions per place. [2024-05-12 13:42:47,606 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 152 selfloop transitions, 93 changer transitions 0/253 dead transitions. [2024-05-12 13:42:47,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 253 transitions, 3198 flow [2024-05-12 13:42:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-05-12 13:42:47,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015197568389058 [2024-05-12 13:42:47,608 INFO L175 Difference]: Start difference. First operand has 149 places, 213 transitions, 2354 flow. Second operand 7 states and 165 transitions. [2024-05-12 13:42:47,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 253 transitions, 3198 flow [2024-05-12 13:42:47,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 253 transitions, 3042 flow, removed 51 selfloop flow, removed 4 redundant places. [2024-05-12 13:42:47,674 INFO L231 Difference]: Finished difference. Result has 153 places, 220 transitions, 2618 flow [2024-05-12 13:42:47,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2618, PETRI_PLACES=153, PETRI_TRANSITIONS=220} [2024-05-12 13:42:47,675 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 102 predicate places. [2024-05-12 13:42:47,675 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 220 transitions, 2618 flow [2024-05-12 13:42:47,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:47,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:47,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:47,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 13:42:47,676 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:47,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 278939984, now seen corresponding path program 3 times [2024-05-12 13:42:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124957731] [2024-05-12 13:42:47,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:49,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:49,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124957731] [2024-05-12 13:42:49,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124957731] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:49,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:49,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 13:42:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196476786] [2024-05-12 13:42:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:49,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 13:42:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:49,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 13:42:49,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 13:42:49,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 47 [2024-05-12 13:42:49,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 220 transitions, 2618 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:49,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:49,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 47 [2024-05-12 13:42:49,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:51,431 INFO L124 PetriNetUnfolderBase]: 4017/6245 cut-off events. [2024-05-12 13:42:51,432 INFO L125 PetriNetUnfolderBase]: For 37756/38050 co-relation queries the response was YES. [2024-05-12 13:42:51,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26080 conditions, 6245 events. 4017/6245 cut-off events. For 37756/38050 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 37145 event pairs, 1394 based on Foata normal form. 16/6197 useless extension candidates. Maximal degree in co-relation 26010. Up to 5501 conditions per place. [2024-05-12 13:42:51,487 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 161 selfloop transitions, 92 changer transitions 0/261 dead transitions. [2024-05-12 13:42:51,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 261 transitions, 3311 flow [2024-05-12 13:42:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 13:42:51,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227963525835866 [2024-05-12 13:42:51,489 INFO L175 Difference]: Start difference. First operand has 153 places, 220 transitions, 2618 flow. Second operand 7 states and 172 transitions. [2024-05-12 13:42:51,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 261 transitions, 3311 flow [2024-05-12 13:42:51,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 261 transitions, 3144 flow, removed 55 selfloop flow, removed 3 redundant places. [2024-05-12 13:42:51,562 INFO L231 Difference]: Finished difference. Result has 157 places, 220 transitions, 2641 flow [2024-05-12 13:42:51,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2641, PETRI_PLACES=157, PETRI_TRANSITIONS=220} [2024-05-12 13:42:51,563 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 106 predicate places. [2024-05-12 13:42:51,563 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 220 transitions, 2641 flow [2024-05-12 13:42:51,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:51,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:51,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:51,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 13:42:51,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:51,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1291467146, now seen corresponding path program 1 times [2024-05-12 13:42:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552095944] [2024-05-12 13:42:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552095944] [2024-05-12 13:42:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552095944] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:53,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:53,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791039003] [2024-05-12 13:42:53,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:53,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:53,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:53,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:53,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:42:53,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 220 transitions, 2641 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:53,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:53,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:42:53,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:55,361 INFO L124 PetriNetUnfolderBase]: 3516/5586 cut-off events. [2024-05-12 13:42:55,361 INFO L125 PetriNetUnfolderBase]: For 33031/33036 co-relation queries the response was YES. [2024-05-12 13:42:55,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23836 conditions, 5586 events. 3516/5586 cut-off events. For 33031/33036 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 33315 event pairs, 1303 based on Foata normal form. 3/5583 useless extension candidates. Maximal degree in co-relation 23765. Up to 4986 conditions per place. [2024-05-12 13:42:55,408 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 193 selfloop transitions, 43 changer transitions 0/245 dead transitions. [2024-05-12 13:42:55,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 245 transitions, 3290 flow [2024-05-12 13:42:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-05-12 13:42:55,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167173252279635 [2024-05-12 13:42:55,411 INFO L175 Difference]: Start difference. First operand has 157 places, 220 transitions, 2641 flow. Second operand 7 states and 170 transitions. [2024-05-12 13:42:55,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 245 transitions, 3290 flow [2024-05-12 13:42:55,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 245 transitions, 2991 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-05-12 13:42:55,486 INFO L231 Difference]: Finished difference. Result has 158 places, 229 transitions, 2573 flow [2024-05-12 13:42:55,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2573, PETRI_PLACES=158, PETRI_TRANSITIONS=229} [2024-05-12 13:42:55,486 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 107 predicate places. [2024-05-12 13:42:55,487 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 229 transitions, 2573 flow [2024-05-12 13:42:55,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:55,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:55,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:55,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 13:42:55,487 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:55,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1635958090, now seen corresponding path program 1 times [2024-05-12 13:42:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:55,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908313852] [2024-05-12 13:42:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:55,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:42:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:42:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:42:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908313852] [2024-05-12 13:42:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908313852] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:42:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:42:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 13:42:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321721577] [2024-05-12 13:42:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:42:57,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 13:42:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:42:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 13:42:57,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 13:42:57,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-05-12 13:42:57,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 229 transitions, 2573 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:57,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:42:57,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-05-12 13:42:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:42:59,092 INFO L124 PetriNetUnfolderBase]: 3381/5439 cut-off events. [2024-05-12 13:42:59,092 INFO L125 PetriNetUnfolderBase]: For 34687/35211 co-relation queries the response was YES. [2024-05-12 13:42:59,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23349 conditions, 5439 events. 3381/5439 cut-off events. For 34687/35211 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 32974 event pairs, 1243 based on Foata normal form. 4/5396 useless extension candidates. Maximal degree in co-relation 23277. Up to 4872 conditions per place. [2024-05-12 13:42:59,128 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 210 selfloop transitions, 20 changer transitions 0/239 dead transitions. [2024-05-12 13:42:59,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 239 transitions, 3100 flow [2024-05-12 13:42:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 13:42:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 13:42:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2024-05-12 13:42:59,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47112462006079026 [2024-05-12 13:42:59,130 INFO L175 Difference]: Start difference. First operand has 158 places, 229 transitions, 2573 flow. Second operand 7 states and 155 transitions. [2024-05-12 13:42:59,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 239 transitions, 3100 flow [2024-05-12 13:42:59,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 239 transitions, 3033 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-05-12 13:42:59,188 INFO L231 Difference]: Finished difference. Result has 163 places, 231 transitions, 2591 flow [2024-05-12 13:42:59,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2506, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2591, PETRI_PLACES=163, PETRI_TRANSITIONS=231} [2024-05-12 13:42:59,189 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 112 predicate places. [2024-05-12 13:42:59,189 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 231 transitions, 2591 flow [2024-05-12 13:42:59,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 13:42:59,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:42:59,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:59,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 13:42:59,190 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 13:42:59,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:42:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1306055498, now seen corresponding path program 1 times [2024-05-12 13:42:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:42:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959553018] [2024-05-12 13:42:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:42:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:42:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:42:59,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:42:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:42:59,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:42:59,309 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:42:59,309 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 7 remaining) [2024-05-12 13:42:59,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-05-12 13:42:59,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 13:42:59,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-12 13:42:59,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 13:42:59,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 13:42:59,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-05-12 13:42:59,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 13:42:59,312 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:42:59,315 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:42:59,315 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:42:59,354 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,356 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,356 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,356 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,357 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,365 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,366 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,366 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,366 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,367 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,368 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-05-12 13:42:59,373 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-05-12 13:42:59,381 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-05-12 13:42:59,381 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-05-12 13:42:59,381 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:42:59 BasicIcfg [2024-05-12 13:42:59,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:42:59,382 INFO L158 Benchmark]: Toolchain (without parser) took 90649.80ms. Allocated memory was 111.1MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 65.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. [2024-05-12 13:42:59,382 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:42:59,382 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:42:59,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.55ms. Allocated memory is still 111.1MB. Free memory was 64.8MB in the beginning and 59.2MB in the end (delta: 5.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-05-12 13:42:59,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 111.1MB. Free memory was 59.2MB in the beginning and 55.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 13:42:59,383 INFO L158 Benchmark]: Boogie Preprocessor took 186.00ms. Allocated memory is still 111.1MB. Free memory was 55.0MB in the beginning and 76.8MB in the end (delta: -21.8MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-05-12 13:42:59,383 INFO L158 Benchmark]: RCFGBuilder took 1242.30ms. Allocated memory was 111.1MB in the beginning and 151.0MB in the end (delta: 39.8MB). Free memory was 76.8MB in the beginning and 53.9MB in the end (delta: 22.9MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-05-12 13:42:59,383 INFO L158 Benchmark]: TraceAbstraction took 88474.72ms. Allocated memory was 151.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 53.9MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. [2024-05-12 13:42:59,384 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.18ms. Allocated memory is still 111.1MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.55ms. Allocated memory is still 111.1MB. Free memory was 64.8MB in the beginning and 59.2MB in the end (delta: 5.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 111.1MB. Free memory was 59.2MB in the beginning and 55.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 186.00ms. Allocated memory is still 111.1MB. Free memory was 55.0MB in the beginning and 76.8MB in the end (delta: -21.8MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1242.30ms. Allocated memory was 111.1MB in the beginning and 151.0MB in the end (delta: 39.8MB). Free memory was 76.8MB in the beginning and 53.9MB in the end (delta: 22.9MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * TraceAbstraction took 88474.72ms. Allocated memory was 151.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 53.9MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 860]: 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; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2381; 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, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 //@ ghost multithreaded = 1; [L855] FCALL, FORK 0 pthread_create(&t2381, ((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, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 pthread_t t2382; [L857] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] FCALL, FORK 0 pthread_create(&t2382, ((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, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381={6:0}, t2382={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 x [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L857] 0 __unbuffered_p2_EAX$read_delayed_var [L858] 0 pthread_t t2383; [L859] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))); [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] FCALL, FORK 0 pthread_create(&t2383, ((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, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2381={6:0}, t2382={7:0}, t2383={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 x [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L859] 0 __unbuffered_p2_EAX$read_delayed_var [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] 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) [L815] EXPR 3 \read(x) [L815] 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) [L815] 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) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 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, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L860] 0 //@ assert (((((((((((((((((((((((((((((((((((((!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((0 <= x$mem_tmp) && (x$mem_tmp <= 2)) && (x$mem_tmp <= 127)) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((((0 <= x) && (x <= 2)) && (x <= 127)) && (((x == 0) || (x == 1)) || (x == 2))))) && (!multithreaded || (__unbuffered_p2_EAX$mem_tmp == 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1 == 0))) && (!multithreaded || (((0 <= __unbuffered_p2_EBX) && (__unbuffered_p2_EBX <= 1)) && ((__unbuffered_p2_EBX == 0) || (__unbuffered_p2_EBX == 1))))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || ((((0 <= __unbuffered_p2_EAX) && (__unbuffered_p2_EAX <= 2)) && (__unbuffered_p2_EAX <= 127)) && (((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)) || (__unbuffered_p2_EAX == 2))))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$w_buff0 == 0))) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p2_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p2_EAX$read_delayed_var == 0) || (((((0 <= *__unbuffered_p2_EAX$read_delayed_var) && (*__unbuffered_p2_EAX$read_delayed_var <= 2)) && (*__unbuffered_p2_EAX$read_delayed_var <= 127)) && (__unbuffered_p2_EAX$read_delayed_var == &x)) && (((*__unbuffered_p2_EAX$read_delayed_var == 0) || (*__unbuffered_p2_EAX$read_delayed_var == 1)) || (*__unbuffered_p2_EAX$read_delayed_var == 2)))))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p2_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 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, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2381={6:0}, t2382={7:0}, t2383={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 857]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 855]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 72 locations, 7 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: 88.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1183 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1014 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4962 IncrementalHoareTripleChecker+Invalid, 5145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 61 mSDtfsCounter, 4962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2641occurred in iteration=21, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 49.2s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 35055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 13:42:59,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE