/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-19 21:55:18,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-19 21:55:18,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-19 21:55:18,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-19 21:55:18,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-19 21:55:18,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-19 21:55:18,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-19 21:55:18,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-19 21:55:18,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-19 21:55:18,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-19 21:55:18,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-19 21:55:18,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-19 21:55:18,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-19 21:55:18,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-19 21:55:18,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-19 21:55:18,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-19 21:55:18,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-19 21:55:18,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-19 21:55:18,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-19 21:55:18,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-19 21:55:18,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-19 21:55:18,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-19 21:55:18,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-19 21:55:18,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-19 21:55:18,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-19 21:55:18,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-19 21:55:18,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-19 21:55:18,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-19 21:55:18,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-19 21:55:18,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-19 21:55:18,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-19 21:55:18,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-19 21:55:18,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-19 21:55:18,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-19 21:55:18,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-19 21:55:18,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-19 21:55:18,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-19 21:55:18,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-19 21:55:18,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-19 21:55:18,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-19 21:55:18,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-19 21:55:18,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-19 21:55:18,145 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-19 21:55:18,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-19 21:55:18,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-19 21:55:18,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-19 21:55:18,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-19 21:55:18,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-19 21:55:18,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * Use SBE=true [2023-05-19 21:55:18,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-19 21:55:18,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-19 21:55:18,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-19 21:55:18,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-19 21:55:18,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 21:55:18,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-19 21:55:18,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-19 21:55:18,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-19 21:55:18,151 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-19 21:55:18,151 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-19 21:55:18,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-19 21:55:18,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-19 21:55:18,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-19 21:55:18,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-19 21:55:18,152 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-19 21:55:18,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> true [2023-05-19 21:55:18,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-19 21:55:18,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-19 21:55:18,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-19 21:55:18,361 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-19 21:55:18,362 INFO L275 PluginConnector]: CDTParser initialized [2023-05-19 21:55:18,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-05-19 21:55:18,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda35f2db/20ed3318a6f84c708529364ed6fe7700/FLAGa8e2f882d [2023-05-19 21:55:18,892 INFO L306 CDTParser]: Found 1 translation units. [2023-05-19 21:55:18,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-05-19 21:55:18,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda35f2db/20ed3318a6f84c708529364ed6fe7700/FLAGa8e2f882d [2023-05-19 21:55:19,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda35f2db/20ed3318a6f84c708529364ed6fe7700 [2023-05-19 21:55:19,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-19 21:55:19,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-19 21:55:19,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-19 21:55:19,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-19 21:55:19,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-19 21:55:19,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3394a4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19, skipping insertion in model container [2023-05-19 21:55:19,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-19 21:55:19,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-19 21:55:19,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-05-19 21:55:19,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-19 21:55:19,627 INFO L203 MainTranslator]: Completed pre-run [2023-05-19 21:55:19,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2023-05-19 21:55:19,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-19 21:55:19,724 INFO L208 MainTranslator]: Completed translation [2023-05-19 21:55:19,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19 WrapperNode [2023-05-19 21:55:19,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-19 21:55:19,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-19 21:55:19,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-19 21:55:19,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-19 21:55:19,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,759 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2023-05-19 21:55:19,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-19 21:55:19,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-19 21:55:19,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-19 21:55:19,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-19 21:55:19,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,776 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-19 21:55:19,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-19 21:55:19,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-19 21:55:19,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-19 21:55:19,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (1/1) ... [2023-05-19 21:55:19,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 21:55:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 21:55:19,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-19 21:55:19,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-19 21:55:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-19 21:55:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-05-19 21:55:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-05-19 21:55:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-19 21:55:19,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-19 21:55:19,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-19 21:55:19,880 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-19 21:55:19,983 INFO L235 CfgBuilder]: Building ICFG [2023-05-19 21:55:19,984 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-19 21:55:20,242 INFO L276 CfgBuilder]: Performing block encoding [2023-05-19 21:55:20,327 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-19 21:55:20,327 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-19 21:55:20,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 09:55:20 BoogieIcfgContainer [2023-05-19 21:55:20,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-19 21:55:20,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-19 21:55:20,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-19 21:55:20,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-19 21:55:20,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.05 09:55:19" (1/3) ... [2023-05-19 21:55:20,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314f7424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 09:55:20, skipping insertion in model container [2023-05-19 21:55:20,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 09:55:19" (2/3) ... [2023-05-19 21:55:20,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314f7424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 09:55:20, skipping insertion in model container [2023-05-19 21:55:20,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 09:55:20" (3/3) ... [2023-05-19 21:55:20,340 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-05-19 21:55:20,347 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-19 21:55:20,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-19 21:55:20,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-19 21:55:20,354 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-19 21:55:20,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-19 21:55:20,470 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 21:55:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 21:55:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 21:55:20,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-19 21:55:20,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-19 21:55:20,563 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 21:55:20,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-19 21:55:20,585 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7cd0c1e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 21:55:20,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-19 21:55:20,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 21:55:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 21:55:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1730553260, now seen corresponding path program 1 times [2023-05-19 21:55:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 21:55:20,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597986621] [2023-05-19 21:55:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 21:55:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 21:55:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 21:55:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 21:55:20,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 21:55:20,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597986621] [2023-05-19 21:55:20,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597986621] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 21:55:20,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 21:55:20,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-19 21:55:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181151280] [2023-05-19 21:55:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 21:55:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-19 21:55:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 21:55:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-19 21:55:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-19 21:55:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:20,966 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 21:55:20,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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) [2023-05-19 21:55:20,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:20,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-19 21:55:20,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 21:55:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 21:55:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1023814675, now seen corresponding path program 1 times [2023-05-19 21:55:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 21:55:20,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504591427] [2023-05-19 21:55:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 21:55:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 21:55:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 21:55:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 21:55:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 21:55:21,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504591427] [2023-05-19 21:55:21,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504591427] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 21:55:21,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 21:55:21,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-19 21:55:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466614693] [2023-05-19 21:55:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 21:55:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-19 21:55:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 21:55:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-19 21:55:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-05-19 21:55:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:21,442 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 21:55:21,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2023-05-19 21:55:21,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:21,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:21,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-19 21:55:21,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 21:55:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 21:55:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1745908722, now seen corresponding path program 1 times [2023-05-19 21:55:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 21:55:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438927911] [2023-05-19 21:55:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 21:55:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 21:55:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 21:55:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 21:55:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 21:55:22,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438927911] [2023-05-19 21:55:22,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438927911] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 21:55:22,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 21:55:22,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-19 21:55:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867121875] [2023-05-19 21:55:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 21:55:22,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-19 21:55:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 21:55:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-19 21:55:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-19 21:55:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 21:55:22,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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) [2023-05-19 21:55:22,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:22,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:22,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-19 21:55:22,263 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 21:55:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 21:55:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 386851524, now seen corresponding path program 1 times [2023-05-19 21:55:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 21:55:22,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430181404] [2023-05-19 21:55:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 21:55:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 21:55:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 21:55:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 21:55:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 21:55:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430181404] [2023-05-19 21:55:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430181404] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 21:55:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 21:55:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-19 21:55:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744314993] [2023-05-19 21:55:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 21:55:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-19 21:55:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 21:55:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-19 21:55:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-05-19 21:55:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,578 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 21:55:22,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-19 21:55:22,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:22,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:22,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:22,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-19 21:55:22,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 21:55:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 21:55:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1489404280, now seen corresponding path program 2 times [2023-05-19 21:55:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 21:55:22,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003680778] [2023-05-19 21:55:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 21:55:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 21:55:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 21:55:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 21:55:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 21:55:23,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003680778] [2023-05-19 21:55:23,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003680778] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 21:55:23,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 21:55:23,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-05-19 21:55:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679368585] [2023-05-19 21:55:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 21:55:23,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-19 21:55:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 21:55:23,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-19 21:55:23,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-05-19 21:55:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:23,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 21:55:23,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-19 21:55:23,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:23,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:23,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:23,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:23,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 21:55:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-19 21:55:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-19 21:55:23,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-19 21:55:23,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 21:55:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 21:55:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash 648800132, now seen corresponding path program 3 times [2023-05-19 21:55:23,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 21:55:23,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935625893] [2023-05-19 21:55:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 21:55:23,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 21:55:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-19 21:55:23,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-19 21:55:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-19 21:55:23,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-19 21:55:23,381 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-19 21:55:23,382 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-19 21:55:23,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-19 21:55:23,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-19 21:55:23,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-19 21:55:23,391 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-05-19 21:55:23,393 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-05-19 21:55:23,396 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-19 21:55:23,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-19 21:55:23,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.05 09:55:23 BasicIcfg [2023-05-19 21:55:23,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-19 21:55:23,494 INFO L158 Benchmark]: Toolchain (without parser) took 4278.59ms. Allocated memory was 198.2MB in the beginning and 332.4MB in the end (delta: 134.2MB). Free memory was 164.8MB in the beginning and 268.4MB in the end (delta: -103.5MB). Peak memory consumption was 142.1MB. Max. memory is 8.0GB. [2023-05-19 21:55:23,495 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 198.2MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-19 21:55:23,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.81ms. Allocated memory was 198.2MB in the beginning and 249.6MB in the end (delta: 51.4MB). Free memory was 164.8MB in the beginning and 204.3MB in the end (delta: -39.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-05-19 21:55:23,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.53ms. Allocated memory is still 249.6MB. Free memory was 204.3MB in the beginning and 201.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-19 21:55:23,495 INFO L158 Benchmark]: Boogie Preprocessor took 20.16ms. Allocated memory is still 249.6MB. Free memory was 201.7MB in the beginning and 200.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-19 21:55:23,496 INFO L158 Benchmark]: RCFGBuilder took 549.34ms. Allocated memory is still 249.6MB. Free memory was 199.6MB in the beginning and 164.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-05-19 21:55:23,496 INFO L158 Benchmark]: TraceAbstraction took 3162.27ms. Allocated memory was 249.6MB in the beginning and 332.4MB in the end (delta: 82.8MB). Free memory was 163.4MB in the beginning and 268.4MB in the end (delta: -105.0MB). Peak memory consumption was 90.6MB. Max. memory is 8.0GB. [2023-05-19 21:55:23,497 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 198.2MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.81ms. Allocated memory was 198.2MB in the beginning and 249.6MB in the end (delta: 51.4MB). Free memory was 164.8MB in the beginning and 204.3MB in the end (delta: -39.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.53ms. Allocated memory is still 249.6MB. Free memory was 204.3MB in the beginning and 201.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.16ms. Allocated memory is still 249.6MB. Free memory was 201.7MB in the beginning and 200.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 549.34ms. Allocated memory is still 249.6MB. Free memory was 199.6MB in the beginning and 164.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3162.27ms. Allocated memory was 249.6MB in the beginning and 332.4MB in the end (delta: 82.8MB). Free memory was 163.4MB in the beginning and 268.4MB in the end (delta: -105.0MB). Peak memory consumption was 90.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2526, independent: 1843, independent conditional: 975, independent unconditional: 868, dependent: 683, dependent conditional: 656, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1896, independent: 1843, independent conditional: 975, independent unconditional: 868, dependent: 53, dependent conditional: 26, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1896, independent: 1843, independent conditional: 975, independent unconditional: 868, dependent: 53, dependent conditional: 26, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2009, independent: 1843, independent conditional: 20, independent unconditional: 1823, dependent: 166, dependent conditional: 93, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2009, independent: 1843, independent conditional: 20, independent unconditional: 1823, dependent: 166, dependent conditional: 15, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2009, independent: 1843, independent conditional: 20, independent unconditional: 1823, dependent: 166, dependent conditional: 15, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 902, independent: 872, independent conditional: 4, independent unconditional: 868, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 902, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 246, independent: 37, independent conditional: 9, independent unconditional: 27, dependent: 210, dependent conditional: 9, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2009, independent: 971, independent conditional: 16, independent unconditional: 955, dependent: 136, dependent conditional: 13, dependent unconditional: 123, unknown: 902, unknown conditional: 6, unknown unconditional: 896] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 872, Positive conditional cache size: 4, Positive unconditional cache size: 868, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 78, Maximal queried relation: 4, Independence queries for same thread: 630 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 179, Number of trivial persistent sets: 100, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 895, independent: 868, independent conditional: 0, independent unconditional: 868, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2526, independent: 1843, independent conditional: 975, independent unconditional: 868, dependent: 683, dependent conditional: 656, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1896, independent: 1843, independent conditional: 975, independent unconditional: 868, dependent: 53, dependent conditional: 26, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1896, independent: 1843, independent conditional: 975, independent unconditional: 868, dependent: 53, dependent conditional: 26, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2009, independent: 1843, independent conditional: 20, independent unconditional: 1823, dependent: 166, dependent conditional: 93, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2009, independent: 1843, independent conditional: 20, independent unconditional: 1823, dependent: 166, dependent conditional: 15, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2009, independent: 1843, independent conditional: 20, independent unconditional: 1823, dependent: 166, dependent conditional: 15, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 902, independent: 872, independent conditional: 4, independent unconditional: 868, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 902, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 246, independent: 37, independent conditional: 9, independent unconditional: 27, dependent: 210, dependent conditional: 9, dependent unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2009, independent: 971, independent conditional: 16, independent unconditional: 955, dependent: 136, dependent conditional: 13, dependent unconditional: 123, unknown: 902, unknown conditional: 6, unknown unconditional: 896] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 872, Positive conditional cache size: 4, Positive unconditional cache size: 868, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 78, Maximal queried relation: 4, Independence queries for same thread: 630 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L722] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L738] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L739] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L725] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$read_delayed_var={0:0}] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$read_delayed_var={0:0}] [L726] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$read_delayed_var={0:0}] [L724] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=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$read_delayed_var={0:0}] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$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] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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$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] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd1=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] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=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] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=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, y=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L826] 0 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L828] 0 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 1 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 1574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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! [2023-05-19 21:55:23,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-19 21:55:23,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...