/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 14:28:46,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 14:28:46,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 14:28:46,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 14:28:46,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 14:28:46,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 14:28:46,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 14:28:46,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 14:28:46,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 14:28:46,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 14:28:46,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 14:28:46,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 14:28:46,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 14:28:46,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:28:46,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:28:46,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 14:28:46,084 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 14:28:46,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 14:28:46,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 14:28:46,085 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 14:28:46,085 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 14:28:46,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 14:28:46,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 14:28:46,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 14:28:46,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 14:28:46,315 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 14:28:46,317 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 14:28:46,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2025-04-14 14:28:47,654 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ec3c3eb/9d10a5582a0f4c21aaf61cac605121be/FLAG36ecf86b1 [2025-04-14 14:28:47,852 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 14:28:47,853 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2025-04-14 14:28:47,861 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ec3c3eb/9d10a5582a0f4c21aaf61cac605121be/FLAG36ecf86b1 [2025-04-14 14:28:48,655 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ec3c3eb/9d10a5582a0f4c21aaf61cac605121be [2025-04-14 14:28:48,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 14:28:48,658 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 14:28:48,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 14:28:48,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 14:28:48,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 14:28:48,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:28:48" (1/1) ... [2025-04-14 14:28:48,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4c1b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:48, skipping insertion in model container [2025-04-14 14:28:48,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:28:48" (1/1) ... [2025-04-14 14:28:48,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 14:28:48,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i[944,957] [2025-04-14 14:28:49,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:28:49,042 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 14:28:49,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i[944,957] [2025-04-14 14:28:49,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:28:49,140 INFO L204 MainTranslator]: Completed translation [2025-04-14 14:28:49,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49 WrapperNode [2025-04-14 14:28:49,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 14:28:49,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 14:28:49,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 14:28:49,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 14:28:49,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,188 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2025-04-14 14:28:49,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 14:28:49,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 14:28:49,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 14:28:49,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 14:28:49,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 14:28:49,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 14:28:49,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 14:28:49,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 14:28:49,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (1/1) ... [2025-04-14 14:28:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:28:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:28:49,256 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) [2025-04-14 14:28:49,258 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 [2025-04-14 14:28:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 14:28:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 14:28:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 14:28:49,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 14:28:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 14:28:49,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 14:28:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 14:28:49,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 14:28:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-14 14:28:49,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-14 14:28:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 14:28:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 14:28:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 14:28:49,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 14:28:49,275 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 14:28:49,382 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 14:28:49,383 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 14:28:49,633 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 14:28:49,633 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 14:28:49,806 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 14:28:49,806 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 14:28:49,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:28:49 BoogieIcfgContainer [2025-04-14 14:28:49,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 14:28:49,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 14:28:49,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 14:28:49,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 14:28:49,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:28:48" (1/3) ... [2025-04-14 14:28:49,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2886eabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:28:49, skipping insertion in model container [2025-04-14 14:28:49,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:28:49" (2/3) ... [2025-04-14 14:28:49,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2886eabc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:28:49, skipping insertion in model container [2025-04-14 14:28:49,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:28:49" (3/3) ... [2025-04-14 14:28:49,814 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2025-04-14 14:28:49,824 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 14:28:49,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 50 locations, 46 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 14:28:49,826 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 14:28:49,872 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 14:28:49,905 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:28:49,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 14:28:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:28:49,908 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) [2025-04-14 14:28:49,910 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 [2025-04-14 14:28:49,978 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:28:49,989 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P3Thread1of1ForFork3 ======== [2025-04-14 14:28:49,995 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@66767531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:28:49,995 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:28:55,487 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:28:55,487 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:28:55,487 INFO L139 ounterexampleChecker]: Examining path program with hash 1007306212, occurence #1 [2025-04-14 14:28:55,487 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:28:55,487 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:28:55,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:28:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash 630307719, now seen corresponding path program 1 times [2025-04-14 14:28:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:28:55,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297990405] [2025-04-14 14:28:55,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:28:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:28:55,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 14:28:55,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 14:28:55,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:28:55,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:28:56,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:28:56,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:28:56,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297990405] [2025-04-14 14:28:56,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297990405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:28:56,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:28:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:28:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655581149] [2025-04-14 14:28:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:28:56,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:28:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:28:56,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:28:56,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:28:56,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:28:56,403 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:28:56,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) [2025-04-14 14:28:56,404 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:07,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:29:07,731 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 14:29:07,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 14:29:07,737 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 14:29:07,738 INFO L320 ceAbstractionStarter]: Result for error location P3Thread1of1ForFork3 was SAFE (1/2) [2025-04-14 14:29:07,742 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:29:07,742 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:29:07,745 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 14:29:07,746 INFO L340 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@66767531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:29:07,746 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 14:29:07,755 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 14:29:07,756 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:29:07,756 INFO L139 ounterexampleChecker]: Examining path program with hash 1820660231, occurence #1 [2025-04-14 14:29:07,756 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:29:07,756 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:29:07,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:29:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 31071398, now seen corresponding path program 1 times [2025-04-14 14:29:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:29:07,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334397793] [2025-04-14 14:29:07,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:29:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:29:07,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 14:29:07,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 14:29:07,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:29:07,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:29:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:29:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:29:08,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334397793] [2025-04-14 14:29:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334397793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:29:08,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:29:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:29:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641415143] [2025-04-14 14:29:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:29:08,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:29:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:29:08,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:29:08,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:29:08,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:08,018 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:29:08,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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) [2025-04-14 14:29:08,018 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:11,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:11,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 14:29:11,771 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 14:29:11,771 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:29:11,771 INFO L139 ounterexampleChecker]: Examining path program with hash -2010611633, occurence #1 [2025-04-14 14:29:11,771 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:29:11,771 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:29:11,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:29:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1941965461, now seen corresponding path program 1 times [2025-04-14 14:29:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:29:11,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19548306] [2025-04-14 14:29:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:29:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:29:11,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 14:29:11,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 14:29:11,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:29:11,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:29:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:29:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:29:12,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19548306] [2025-04-14 14:29:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19548306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:29:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:29:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:29:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921216338] [2025-04-14 14:29:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:29:12,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 14:29:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:29:12,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 14:29:12,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 14:29:12,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:12,080 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:29:12,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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) [2025-04-14 14:29:12,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:12,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:12,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:12,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:12,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 14:29:12,216 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 14:29:12,216 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:29:12,216 INFO L139 ounterexampleChecker]: Examining path program with hash 620886374, occurence #1 [2025-04-14 14:29:12,216 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:29:12,216 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:29:12,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:29:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1056051833, now seen corresponding path program 1 times [2025-04-14 14:29:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:29:12,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180977751] [2025-04-14 14:29:12,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:29:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:29:12,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 14:29:12,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 14:29:12,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:29:12,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:29:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:29:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:29:12,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180977751] [2025-04-14 14:29:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180977751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:29:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:29:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:29:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878984738] [2025-04-14 14:29:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:29:12,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:29:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:29:12,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:29:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:29:12,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:12,497 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:29:12,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2025-04-14 14:29:12,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:12,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:12,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:26,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:26,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:26,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:26,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 14:29:26,683 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 14:29:26,683 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:29:26,683 INFO L139 ounterexampleChecker]: Examining path program with hash -2014620288, occurence #1 [2025-04-14 14:29:26,683 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:29:26,683 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:29:26,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:29:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -422379245, now seen corresponding path program 2 times [2025-04-14 14:29:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:29:26,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24163843] [2025-04-14 14:29:26,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:29:26,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:29:26,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 1 equivalence classes. [2025-04-14 14:29:26,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 14:29:26,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:29:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:29:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:29:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:29:26,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24163843] [2025-04-14 14:29:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24163843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:29:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:29:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:29:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637993816] [2025-04-14 14:29:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:29:26,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:29:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:29:26,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:29:26,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:29:26,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:26,920 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:29:26,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2025-04-14 14:29:26,920 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:26,921 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:26,921 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:26,921 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:27,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:27,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:27,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:27,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:29:27,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 14:29:27,446 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 14:29:27,446 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:29:27,446 INFO L139 ounterexampleChecker]: Examining path program with hash -2086951152, occurence #1 [2025-04-14 14:29:27,446 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:29:27,446 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:29:27,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:29:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 532390067, now seen corresponding path program 3 times [2025-04-14 14:29:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:29:27,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800986563] [2025-04-14 14:29:27,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 14:29:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:29:27,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 1 equivalence classes. [2025-04-14 14:29:27,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 14:29:27,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 14:29:27,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:29:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:29:28,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:29:28,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800986563] [2025-04-14 14:29:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800986563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:29:28,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:29:28,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 14:29:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939145770] [2025-04-14 14:29:28,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:29:28,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 14:29:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:29:28,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 14:29:28,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-14 14:29:28,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:28,538 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:29:28,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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) [2025-04-14 14:29:28,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:28,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:28,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:28,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:29:28,538 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:29:36,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:29:36,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:36,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:29:36,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:29:36,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 14:29:36,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 14:29:36,955 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 14:29:36,955 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:29:36,956 INFO L139 ounterexampleChecker]: Examining path program with hash 1382452513, occurence #1 [2025-04-14 14:29:36,956 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:29:36,956 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:29:36,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:29:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 896720229, now seen corresponding path program 4 times [2025-04-14 14:29:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:29:36,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132540149] [2025-04-14 14:29:36,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 14:29:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:29:36,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-14 14:29:37,009 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 14:29:37,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 14:29:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:29:37,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 14:29:37,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 14:29:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 14:29:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:29:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:29:37,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 14:29:37,091 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 14:29:37,091 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 14:29:37,091 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-14 14:29:37,091 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-14 14:29:37,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-14 14:29:37,092 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 14:29:37,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 14:29:37,092 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2025-04-14 14:29:37,093 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2025-04-14 14:29:37,191 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 14:29:37,191 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 14:29:37,205 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 [2025-04-14 14:29:37,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:29:37 BasicIcfg [2025-04-14 14:29:37,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 14:29:37,207 INFO L158 Benchmark]: Toolchain (without parser) took 48548.52ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 96.6MB in the beginning and 780.3MB in the end (delta: -683.7MB). Peak memory consumption was 193.1MB. Max. memory is 8.0GB. [2025-04-14 14:29:37,208 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:29:37,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.67ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 68.9MB in the end (delta: 27.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 14:29:37,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.83ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 66.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 14:29:37,208 INFO L158 Benchmark]: Boogie Preprocessor took 24.94ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 64.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:29:37,208 INFO L158 Benchmark]: IcfgBuilder took 581.85ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 75.0MB in the end (delta: -10.2MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2025-04-14 14:29:37,209 INFO L158 Benchmark]: TraceAbstraction took 47398.08ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 74.3MB in the beginning and 780.3MB in the end (delta: -706.1MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2025-04-14 14:29:37,210 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.67ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 68.9MB in the end (delta: 27.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.83ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 66.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.94ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 64.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 581.85ms. Allocated memory is still 142.6MB. Free memory was 64.8MB in the beginning and 75.0MB in the end (delta: -10.2MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. * TraceAbstraction took 47398.08ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 74.3MB in the beginning and 780.3MB in the end (delta: -706.1MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29971, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 784, dependent conditional: 754, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29957, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 770, dependent conditional: 740, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29957, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 770, dependent conditional: 740, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31025, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 1838, dependent conditional: 1808, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31025, independent: 29187, independent conditional: 328, independent unconditional: 28859, dependent: 1838, dependent conditional: 198, dependent unconditional: 1640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31025, independent: 29187, independent conditional: 328, independent unconditional: 28859, dependent: 1838, dependent conditional: 198, dependent unconditional: 1640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1369, independent: 1335, independent conditional: 5, independent unconditional: 1330, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1369, independent: 1318, independent conditional: 0, independent unconditional: 1318, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16139, independent: 5333, independent conditional: 5227, independent unconditional: 106, dependent: 10806, dependent conditional: 718, dependent unconditional: 10089, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 31025, independent: 27852, independent conditional: 323, independent unconditional: 27529, dependent: 1804, dependent conditional: 196, dependent unconditional: 1608, unknown: 1369, unknown conditional: 7, unknown unconditional: 1362] , Statistics on independence cache: Total cache size (in pairs): 1369, Positive cache size: 1335, Positive conditional cache size: 5, Positive unconditional cache size: 1330, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29139, Maximal queried relation: 1, Independence queries for same thread: 14, Persistent sets #1 benchmarks: Persistent set computation time: 9.9s, Number of persistent set computation: 3100, Number of trivial persistent sets: 1034, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1360, independent: 1330, independent conditional: 0, independent unconditional: 1330, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29971, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 784, dependent conditional: 754, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29957, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 770, dependent conditional: 740, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29957, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 770, dependent conditional: 740, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31025, independent: 29187, independent conditional: 27857, independent unconditional: 1330, dependent: 1838, dependent conditional: 1808, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31025, independent: 29187, independent conditional: 328, independent unconditional: 28859, dependent: 1838, dependent conditional: 198, dependent unconditional: 1640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31025, independent: 29187, independent conditional: 328, independent unconditional: 28859, dependent: 1838, dependent conditional: 198, dependent unconditional: 1640, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1369, independent: 1335, independent conditional: 5, independent unconditional: 1330, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1369, independent: 1318, independent conditional: 0, independent unconditional: 1318, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16139, independent: 5333, independent conditional: 5227, independent unconditional: 106, dependent: 10806, dependent conditional: 718, dependent unconditional: 10089, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 31025, independent: 27852, independent conditional: 323, independent unconditional: 27529, dependent: 1804, dependent conditional: 196, dependent unconditional: 1608, unknown: 1369, unknown conditional: 7, unknown unconditional: 1362] , Statistics on independence cache: Total cache size (in pairs): 1369, Positive cache size: 1335, Positive conditional cache size: 5, Positive unconditional cache size: 1330, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29139, Maximal queried relation: 1, Independence queries for same thread: 14 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 105022, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 1488, dependent conditional: 1456, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104840, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 1306, dependent conditional: 1274, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104840, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 1306, dependent conditional: 1274, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119562, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 16028, dependent conditional: 15996, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119562, independent: 103534, independent conditional: 3480, independent unconditional: 100054, dependent: 16028, dependent conditional: 152, dependent unconditional: 15876, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119562, independent: 103534, independent conditional: 3480, independent unconditional: 100054, dependent: 16028, dependent conditional: 152, dependent unconditional: 15876, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 164, independent: 150, independent conditional: 23, independent unconditional: 127, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 164, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 23, independent unconditional: 3, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 23, independent unconditional: 3, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24940, independent: 1117, independent conditional: 1111, independent unconditional: 6, dependent: 23823, dependent conditional: 6923, dependent unconditional: 16900, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 119562, independent: 103384, independent conditional: 3457, independent unconditional: 99927, dependent: 16014, dependent conditional: 148, dependent unconditional: 15866, unknown: 164, unknown conditional: 27, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1480, Positive conditional cache size: 23, Positive unconditional cache size: 1457, Negative cache size: 46, Negative conditional cache size: 4, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114653, Maximal queried relation: 5, Independence queries for same thread: 182, Persistent sets #1 benchmarks: Persistent set computation time: 16.1s, Number of persistent set computation: 5086, Number of trivial persistent sets: 2650, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1277, independent: 1245, independent conditional: 0, independent unconditional: 1245, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 105022, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 1488, dependent conditional: 1456, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104840, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 1306, dependent conditional: 1274, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104840, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 1306, dependent conditional: 1274, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119562, independent: 103534, independent conditional: 102289, independent unconditional: 1245, dependent: 16028, dependent conditional: 15996, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119562, independent: 103534, independent conditional: 3480, independent unconditional: 100054, dependent: 16028, dependent conditional: 152, dependent unconditional: 15876, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119562, independent: 103534, independent conditional: 3480, independent unconditional: 100054, dependent: 16028, dependent conditional: 152, dependent unconditional: 15876, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 164, independent: 150, independent conditional: 23, independent unconditional: 127, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 164, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 23, independent unconditional: 3, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 26, independent conditional: 23, independent unconditional: 3, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24940, independent: 1117, independent conditional: 1111, independent unconditional: 6, dependent: 23823, dependent conditional: 6923, dependent unconditional: 16900, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 119562, independent: 103384, independent conditional: 3457, independent unconditional: 99927, dependent: 16014, dependent conditional: 148, dependent unconditional: 15866, unknown: 164, unknown conditional: 27, unknown unconditional: 137] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1480, Positive conditional cache size: 23, Positive unconditional cache size: 1457, Negative cache size: 46, Negative conditional cache size: 4, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114653, Maximal queried relation: 5, Independence queries for same thread: 182 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, t327=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 return 0; [L789] 3 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L858] 4 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 876]: 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: 874]: 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: 878]: 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: 872]: 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 for errors in thread instance: P3Thread1of1ForFork3 with 1 thread instances CFG has 9 procedures, 85 locations, 81 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.8s, 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: 3, 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, 0.7s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 85 locations, 81 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 27.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: 35, 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.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1488 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 14:29:37,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...