./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi005.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi005.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/rfi005.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi005.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-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:43:41,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:43:41,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:43:41,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:43:41,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:43:41,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:43:41,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:43:41,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:43:41,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:43:41,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:43:41,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:43:41,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:43:41,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:43:41,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:43:41,704 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:43:41,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:43:41,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:43:41,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:43:41,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:43:41,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:43:41,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:43:41,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:43:41,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:43:41,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:43:41,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:43:41,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:43:41,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:43:41,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:43:41,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:43:41,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:43:41,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:43:41,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:43:41,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:43:41,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:43:41,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:43:41,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:43:41,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:43:41,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:43:41,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:43:41,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:43:41,715 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:43:41,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:43:41,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:43:41,716 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-06-28 01:43:41,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:43:41,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:43:41,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:43:41,947 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:43:41,947 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:43:41,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/rfi005.yml/witness.yml [2024-06-28 01:43:42,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:43:42,077 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:43:42,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi005.i [2024-06-28 01:43:43,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:43:43,365 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:43:43,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi005.i [2024-06-28 01:43:43,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb41cd0a/42783fb94f6f4a44abe05fae915204e6/FLAG0d7170d74 [2024-06-28 01:43:43,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb41cd0a/42783fb94f6f4a44abe05fae915204e6 [2024-06-28 01:43:43,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:43:43,400 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:43:43,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:43:43,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:43:43,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:43:43,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:43:42" (1/2) ... [2024-06-28 01:43:43,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45068e29 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:43:43, skipping insertion in model container [2024-06-28 01:43:43,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:43:42" (1/2) ... [2024-06-28 01:43:43,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3515cb94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:43:43, skipping insertion in model container [2024-06-28 01:43:43,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:43:43" (2/2) ... [2024-06-28 01:43:43,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45068e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:43, skipping insertion in model container [2024-06-28 01:43:43,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:43:43" (2/2) ... [2024-06-28 01:43:43,412 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:43:43,475 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:43:43,476 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] (((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)) && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)) [2024-06-28 01:43:43,476 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] (((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (((((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)) && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2))) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)) [2024-06-28 01:43:43,476 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:43:43,476 INFO L106 edCorrectnessWitness]: ghost_update [L835-L835] multithreaded = 1; [2024-06-28 01:43:43,507 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:43:43,652 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi005.i[983,996] [2024-06-28 01:43:43,833 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:43:43,841 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 01:43:43,869 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi005.i[983,996] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:43:43,925 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:43:44,038 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:43:44,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44 WrapperNode [2024-06-28 01:43:44,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:43:44,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:43:44,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:43:44,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:43:44,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,097 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-06-28 01:43:44,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:43:44,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:43:44,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:43:44,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:43:44,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,125 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 01:43:44,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:43:44,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:43:44,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:43:44,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:43:44,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (1/1) ... [2024-06-28 01:43:44,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:43:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:43:44,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 01:43:44,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 01:43:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:43:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:43:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 01:43:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 01:43:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 01:43:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 01:43:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:43:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:43:44,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:43:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:43:44,193 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:43:44,307 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:43:44,308 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:43:44,687 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:43:44,688 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:43:44,870 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:43:44,870 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 01:43:44,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:43:44 BoogieIcfgContainer [2024-06-28 01:43:44,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:43:44,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:43:44,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:43:44,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:43:44,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:43:42" (1/4) ... [2024-06-28 01:43:44,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ddbd89 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:43:44, skipping insertion in model container [2024-06-28 01:43:44,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:43:43" (2/4) ... [2024-06-28 01:43:44,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ddbd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:43:44, skipping insertion in model container [2024-06-28 01:43:44,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:43:44" (3/4) ... [2024-06-28 01:43:44,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ddbd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:43:44, skipping insertion in model container [2024-06-28 01:43:44,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:43:44" (4/4) ... [2024-06-28 01:43:44,885 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi005.i [2024-06-28 01:43:44,898 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:43:44,899 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 01:43:44,899 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:43:44,930 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:43:44,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 86 flow [2024-06-28 01:43:44,986 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-06-28 01:43:44,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:43:44,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-06-28 01:43:44,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 86 flow [2024-06-28 01:43:44,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 80 flow [2024-06-28 01:43:44,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:43:45,005 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;@3d65845c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:43:45,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 01:43:45,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:43:45,013 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-28 01:43:45,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:43:45,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:45,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:43:45,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:43:45,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash 418634122, now seen corresponding path program 1 times [2024-06-28 01:43:45,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:45,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565318699] [2024-06-28 01:43:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:45,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565318699] [2024-06-28 01:43:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565318699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:43:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021583824] [2024-06-28 01:43:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:43:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:43:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:43:45,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-06-28 01:43:45,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:45,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:45,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-06-28 01:43:45,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:46,140 INFO L124 PetriNetUnfolderBase]: 576/1015 cut-off events. [2024-06-28 01:43:46,140 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 01:43:46,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 1015 events. 576/1015 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5505 event pairs, 236 based on Foata normal form. 46/964 useless extension candidates. Maximal degree in co-relation 1975. Up to 945 conditions per place. [2024-06-28 01:43:46,173 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 33 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-06-28 01:43:46,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 179 flow [2024-06-28 01:43:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:43:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:43:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-28 01:43:46,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6837606837606838 [2024-06-28 01:43:46,185 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 80 flow. Second operand 3 states and 80 transitions. [2024-06-28 01:43:46,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 179 flow [2024-06-28 01:43:46,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:43:46,192 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 104 flow [2024-06-28 01:43:46,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-28 01:43:46,197 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-06-28 01:43:46,198 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 104 flow [2024-06-28 01:43:46,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:46,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:46,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:46,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:43:46,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:43:46,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1419496343, now seen corresponding path program 1 times [2024-06-28 01:43:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900847606] [2024-06-28 01:43:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:46,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900847606] [2024-06-28 01:43:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900847606] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:43:46,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340232336] [2024-06-28 01:43:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:46,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:43:46,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:43:46,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:43:46,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-06-28 01:43:46,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:46,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:46,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-06-28 01:43:46,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:46,954 INFO L124 PetriNetUnfolderBase]: 635/1219 cut-off events. [2024-06-28 01:43:46,954 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2024-06-28 01:43:46,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 1219 events. 635/1219 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6965 event pairs, 353 based on Foata normal form. 4/1095 useless extension candidates. Maximal degree in co-relation 2503. Up to 1002 conditions per place. [2024-06-28 01:43:46,959 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 44 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-06-28 01:43:46,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 258 flow [2024-06-28 01:43:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:43:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:43:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-28 01:43:46,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2024-06-28 01:43:46,961 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 104 flow. Second operand 4 states and 101 transitions. [2024-06-28 01:43:46,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 258 flow [2024-06-28 01:43:46,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:43:46,963 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 138 flow [2024-06-28 01:43:46,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-06-28 01:43:46,964 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-06-28 01:43:46,964 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 138 flow [2024-06-28 01:43:46,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:46,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:46,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:43:46,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:43:46,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1055438744, now seen corresponding path program 1 times [2024-06-28 01:43:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976426678] [2024-06-28 01:43:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:43:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:43:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:43:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976426678] [2024-06-28 01:43:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976426678] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:43:47,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:43:47,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:43:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267009565] [2024-06-28 01:43:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:43:47,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:43:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:43:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:43:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:43:47,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-06-28 01:43:47,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:47,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:43:47,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-06-28 01:43:47,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:43:47,108 INFO L124 PetriNetUnfolderBase]: 313/688 cut-off events. [2024-06-28 01:43:47,108 INFO L125 PetriNetUnfolderBase]: For 125/133 co-relation queries the response was YES. [2024-06-28 01:43:47,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 688 events. 313/688 cut-off events. For 125/133 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4048 event pairs, 164 based on Foata normal form. 7/612 useless extension candidates. Maximal degree in co-relation 1347. Up to 496 conditions per place. [2024-06-28 01:43:47,111 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 25 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-06-28 01:43:47,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 193 flow [2024-06-28 01:43:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:43:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:43:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-06-28 01:43:47,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7008547008547008 [2024-06-28 01:43:47,113 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 138 flow. Second operand 3 states and 82 transitions. [2024-06-28 01:43:47,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 193 flow [2024-06-28 01:43:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 01:43:47,114 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 118 flow [2024-06-28 01:43:47,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-28 01:43:47,115 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2024-06-28 01:43:47,115 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 118 flow [2024-06-28 01:43:47,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:43:47,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:43:47,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:43:47,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:43:47,116 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 01:43:47,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:43:47,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1641137759, now seen corresponding path program 1 times [2024-06-28 01:43:47,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:43:47,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257757286] [2024-06-28 01:43:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:43:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:43:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:43:47,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:43:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:43:47,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:43:47,145 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:43:47,145 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2024-06-28 01:43:47,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-06-28 01:43:47,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-06-28 01:43:47,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 9 remaining) [2024-06-28 01:43:47,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 9 remaining) [2024-06-28 01:43:47,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2024-06-28 01:43:47,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-06-28 01:43:47,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2024-06-28 01:43:47,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-06-28 01:43:47,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:43:47,148 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-06-28 01:43:47,152 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:43:47,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:43:47,173 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:43:47,174 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:43:47,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:43:47 BasicIcfg [2024-06-28 01:43:47,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:43:47,175 INFO L158 Benchmark]: Toolchain (without parser) took 3774.37ms. Allocated memory was 142.6MB in the beginning and 266.3MB in the end (delta: 123.7MB). Free memory was 89.1MB in the beginning and 94.5MB in the end (delta: -5.5MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2024-06-28 01:43:47,175 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:43:47,175 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 80.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:43:47,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.58ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 106.7MB in the end (delta: -17.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-28 01:43:47,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.23ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 103.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:43:47,176 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 98.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 01:43:47,177 INFO L158 Benchmark]: RCFGBuilder took 730.37ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.0MB in the end (delta: 2.0MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-06-28 01:43:47,177 INFO L158 Benchmark]: TraceAbstraction took 2299.49ms. Allocated memory was 142.6MB in the beginning and 266.3MB in the end (delta: 123.7MB). Free memory was 97.0MB in the beginning and 94.5MB in the end (delta: 2.4MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2024-06-28 01:43:47,179 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 66.9MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 80.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.58ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 106.7MB in the end (delta: -17.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.23ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 103.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 98.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 730.37ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.0MB in the end (delta: 2.0MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2299.49ms. Allocated memory was 142.6MB in the beginning and 266.3MB in the end (delta: 123.7MB). Free memory was 97.0MB in the beginning and 94.5MB in the end (delta: 2.4MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1665; [L835] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1665=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] FCALL, FORK 0 pthread_create(&t1665, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1665=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L836] 0 pthread_t t1666; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1665=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 //@ assert ((((((((((((((((!multithreaded || (y$read_delayed_var == 0)) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))) && (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))) && (((y$w_buff0 == 0) || (y$w_buff0 == 1)) || (y$w_buff0 == 2))) && (((y$w_buff1 == 0) || (y$w_buff1 == 1)) || (y$w_buff1 == 2))))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)) || (__unbuffered_p1_EAX == 2)))) && (!multithreaded || (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y$w_buff1 == 0) || (y$w_buff1 == 1)) || (y$w_buff1 == 2)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((y$w_buff0 == 0) || (y$w_buff0 == 1)) || (y$w_buff0 == 2)))); [L837] FCALL, FORK 0 pthread_create(&t1666, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1665=-1, t1666=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 y$w_buff1 = y$w_buff0 [L783] 2 y$w_buff0 = 2 [L784] 2 y$w_buff1_used = y$w_buff0_used [L785] 2 y$w_buff0_used = (_Bool)1 [L786] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 837]: 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: 835]: 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 5 procedures, 60 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 11 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-28 01:43:47,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE