This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-16 09:32:16,162 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-16 09:32:16,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-16 09:32:16,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-16 09:32:16,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-16 09:32:16,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-16 09:32:16,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-16 09:32:16,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-16 09:32:16,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-16 09:32:16,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-16 09:32:16,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-16 09:32:16,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-16 09:32:16,278 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-16 09:32:16,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-16 09:32:16,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-16 09:32:16,280 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-16 09:32:16,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-16 09:32:16,281 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-16 09:32:16,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-16 09:32:16,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-16 09:32:16,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-16 09:32:16,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-16 09:32:16,286 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-16 09:32:16,286 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-16 09:32:16,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-16 09:32:16,287 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-16 09:32:16,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-16 09:32:16,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-16 09:32:16,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-16 09:32:16,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-16 09:32:16,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 09:32:16,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-16 09:32:16,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-16 09:32:16,289 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-16 09:32:16,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-16 09:32:16,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-16 09:32:16,289 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-16 09:32:16,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-16 09:32:16,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-16 09:32:16,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-16 09:32:16,290 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-16 09:32:16,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT
[2024-10-16 09:32:16,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-16 09:32:16,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-16 09:32:16,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-16 09:32:16,654 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-16 09:32:16,655 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-16 09:32:16,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i
[2024-10-16 09:32:18,288 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-16 09:32:18,576 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-16 09:32:18,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i
[2024-10-16 09:32:18,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f626e564c/133e8940fe0f4e26b896324642276b63/FLAGf4826776d
[2024-10-16 09:32:18,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f626e564c/133e8940fe0f4e26b896324642276b63
[2024-10-16 09:32:18,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-16 09:32:18,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-16 09:32:18,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-16 09:32:18,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-16 09:32:18,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-16 09:32:18,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 09:32:18" (1/1) ...
[2024-10-16 09:32:18,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740c001a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:18, skipping insertion in model container
[2024-10-16 09:32:18,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 09:32:18" (1/1) ...
[2024-10-16 09:32:18,935 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-16 09:32:19,136 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987]
[2024-10-16 09:32:19,330 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-16 09:32:19,343 INFO L200 MainTranslator]: Completed pre-run
[2024-10-16 09:32:19,356 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987]
[2024-10-16 09:32:19,400 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-16 09:32:19,449 INFO L204 MainTranslator]: Completed translation
[2024-10-16 09:32:19,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19 WrapperNode
[2024-10-16 09:32:19,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-16 09:32:19,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-16 09:32:19,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-16 09:32:19,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-16 09:32:19,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,513 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156
[2024-10-16 09:32:19,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-16 09:32:19,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-16 09:32:19,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-16 09:32:19,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-16 09:32:19,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-16 09:32:19,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-16 09:32:19,555 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-16 09:32:19,555 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-16 09:32:19,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (1/1) ...
[2024-10-16 09:32:19,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 09:32:19,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 09:32:19,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-10-16 09:32:19,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-10-16 09:32:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-16 09:32:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-16 09:32:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-16 09:32:19,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-16 09:32:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-16 09:32:19,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-16 09:32:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-10-16 09:32:19,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-10-16 09:32:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-16 09:32:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-16 09:32:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-16 09:32:19,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-16 09:32:19,640 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-16 09:32:19,772 INFO L238 CfgBuilder]: Building ICFG
[2024-10-16 09:32:19,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-16 09:32:20,175 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-16 09:32:20,177 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-16 09:32:20,385 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-16 09:32:20,386 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-16 09:32:20,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 09:32:20 BoogieIcfgContainer
[2024-10-16 09:32:20,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-16 09:32:20,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-16 09:32:20,390 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-16 09:32:20,393 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-16 09:32:20,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 09:32:18" (1/3) ...
[2024-10-16 09:32:20,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c327cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 09:32:20, skipping insertion in model container
[2024-10-16 09:32:20,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:32:19" (2/3) ...
[2024-10-16 09:32:20,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c327cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 09:32:20, skipping insertion in model container
[2024-10-16 09:32:20,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 09:32:20" (3/3) ...
[2024-10-16 09:32:20,398 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i
[2024-10-16 09:32:20,413 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-16 09:32:20,414 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-16 09:32:20,416 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-16 09:32:20,473 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-16 09:32:20,518 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-16 09:32:20,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-16 09:32:20,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 09:32:20,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-10-16 09:32:20,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-10-16 09:32:20,613 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-16 09:32:20,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 09:32:20,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-16 09:32:20,634 INFO L333 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;@713337cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-16 09:32:20,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-10-16 09:32:29,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 09:32:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 09:32:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash 361397834, now seen corresponding path program 1 times
[2024-10-16 09:32:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 09:32:29,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792102536]
[2024-10-16 09:32:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:32:29,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:32:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 09:32:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 09:32:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 09:32:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792102536]
[2024-10-16 09:32:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792102536] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 09:32:30,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 09:32:30,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-16 09:32:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684260247]
[2024-10-16 09:32:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 09:32:30,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-16 09:32:30,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 09:32:30,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-16 09:32:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-16 09:32:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:32:30,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 09:32:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-16 09:32:30,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:32:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:32:52,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-16 09:32:52,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 09:32:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 09:32:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 774236988, now seen corresponding path program 1 times
[2024-10-16 09:32:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 09:32:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262818343]
[2024-10-16 09:32:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:32:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:32:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 09:32:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 09:32:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 09:32:53,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262818343]
[2024-10-16 09:32:53,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262818343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 09:32:53,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 09:32:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-16 09:32:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038666754]
[2024-10-16 09:32:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 09:32:53,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 09:32:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 09:32:53,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 09:32:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-16 09:32:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:32:53,217 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 09:32:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-16 09:32:53,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:32:53,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:32:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:32:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 09:32:57,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-16 09:32:57,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 09:32:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1370011007, now seen corresponding path program 1 times
[2024-10-16 09:32:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:32:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:32:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:32:58,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 09:32:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:32:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 09:32:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 221451864, now seen corresponding path program 1 times
[2024-10-16 09:32:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 09:32:58,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355493277]
[2024-10-16 09:32:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:32:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:32:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 09:33:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 09:33:00,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 09:33:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355493277]
[2024-10-16 09:33:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355493277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 09:33:00,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 09:33:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-10-16 09:33:00,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45707701]
[2024-10-16 09:33:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 09:33:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-16 09:33:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 09:33:00,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-16 09:33:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-10-16 09:33:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:33:00,146 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 09:33:00,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 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)
[2024-10-16 09:33:00,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:33:00,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 09:33:00,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:33:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:33:07,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 09:33:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-16 09:33:07,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2
[2024-10-16 09:33:07,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 09:33:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 287110196, now seen corresponding path program 1 times
[2024-10-16 09:33:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:33:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:33:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:08,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 09:33:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1483790113, now seen corresponding path program 1 times
[2024-10-16 09:33:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:33:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:33:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:08,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 09:33:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:08,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 09:33:08,894 INFO L85 PathProgramCache]: Analyzing trace with hash 727211852, now seen corresponding path program 2 times
[2024-10-16 09:33:08,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 09:33:08,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700869065]
[2024-10-16 09:33:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:33:08,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:33:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 09:33:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 09:33:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 09:33:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700869065]
[2024-10-16 09:33:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700869065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 09:33:10,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 09:33:10,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-16 09:33:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302065427]
[2024-10-16 09:33:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 09:33:10,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-16 09:33:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 09:33:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-16 09:33:10,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2024-10-16 09:33:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:33:10,746 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 09:33:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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)
[2024-10-16 09:33:10,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:33:10,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 09:33:10,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states.
[2024-10-16 09:33:10,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 09:33:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-16 09:33:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 09:33:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-16 09:33:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-10-16 09:33:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5
[2024-10-16 09:33:27,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 09:33:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash -244959923, now seen corresponding path program 1 times
[2024-10-16 09:33:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:33:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:33:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:28,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 09:33:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash 78226207, now seen corresponding path program 1 times
[2024-10-16 09:33:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:33:28,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:33:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:28,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 09:33:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:29,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 09:33:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -978736772, now seen corresponding path program 3 times
[2024-10-16 09:33:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 09:33:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741817749]
[2024-10-16 09:33:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 09:33:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 09:33:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:29,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 09:33:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 09:33:29,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-16 09:33:29,196 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-16 09:33:29,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2024-10-16 09:33:29,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2024-10-16 09:33:29,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2024-10-16 09:33:29,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2024-10-16 09:33:29,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable9
[2024-10-16 09:33:29,211 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1]
[2024-10-16 09:33:29,216 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2)
[2024-10-16 09:33:29,300 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-16 09:33:29,300 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-16 09:33:29,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 09:33:29 BasicIcfg
[2024-10-16 09:33:29,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-16 09:33:29,308 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-16 09:33:29,308 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-16 09:33:29,308 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-16 09:33:29,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 09:32:20" (3/4) ...
[2024-10-16 09:33:29,309 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-16 09:33:29,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-16 09:33:29,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-16 09:33:29,410 INFO L158 Benchmark]: Toolchain (without parser) took 70541.27ms. Allocated memory was 67.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 47.9MB in the beginning and 918.8MB in the end (delta: -870.9MB). Peak memory consumption was 554.8MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,413 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-16 09:33:29,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.05ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 40.7MB in the end (delta: 6.9MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 37.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,413 INFO L158 Benchmark]: Boogie Preprocessor took 32.87ms. Allocated memory is still 67.1MB. Free memory was 37.4MB in the beginning and 35.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,414 INFO L158 Benchmark]: RCFGBuilder took 831.99ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.4MB in the beginning and 30.6MB in the end (delta: 4.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,414 INFO L158 Benchmark]: TraceAbstraction took 68918.22ms. Allocated memory was 81.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 29.6MB in the beginning and 931.4MB in the end (delta: -901.8MB). Peak memory consumption was 510.6MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,414 INFO L158 Benchmark]: Witness Printer took 101.49ms. Allocated memory is still 1.5GB. Free memory was 931.4MB in the beginning and 918.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-16 09:33:29,416 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 52.4MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 581.05ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 40.7MB in the end (delta: 6.9MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 62.35ms. Allocated memory is still 67.1MB. Free memory was 40.7MB in the beginning and 37.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 32.87ms. Allocated memory is still 67.1MB. Free memory was 37.4MB in the beginning and 35.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 831.99ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 35.4MB in the beginning and 30.6MB in the end (delta: 4.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 68918.22ms. Allocated memory was 81.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 29.6MB in the beginning and 931.4MB in the end (delta: -901.8MB). Peak memory consumption was 510.6MB. Max. memory is 16.1GB.
* Witness Printer took 101.49ms. Allocated memory is still 1.5GB. Free memory was 931.4MB in the beginning and 918.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Partial order reduction statistics
Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1702, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 72, dependent conditional: 36, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1692, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 62, dependent conditional: 27, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1692, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 62, dependent conditional: 27, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1692, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 62, dependent conditional: 27, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 304, dependent conditional: 234, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 542, independent conditional: 14, independent unconditional: 528, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58715, independent: 9003, independent conditional: 8837, independent unconditional: 165, dependent: 49712, dependent conditional: 2522, dependent unconditional: 47190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1934, independent: 1088, independent conditional: 48, independent unconditional: 1040, dependent: 262, dependent conditional: 14, dependent unconditional: 248, unknown: 584, unknown conditional: 21, unknown unconditional: 563] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 542, Positive conditional cache size: 14, Positive unconditional cache size: 528, Negative cache size: 42, Negative conditional cache size: 7, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1253, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 304, dependent conditional: 234, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 542, independent conditional: 14, independent unconditional: 528, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58715, independent: 9003, independent conditional: 8837, independent unconditional: 165, dependent: 49712, dependent conditional: 2522, dependent unconditional: 47190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1934, independent: 1088, independent conditional: 48, independent unconditional: 1040, dependent: 262, dependent conditional: 14, dependent unconditional: 248, unknown: 584, unknown conditional: 21, unknown unconditional: 563] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 542, Positive conditional cache size: 14, Positive unconditional cache size: 528, Negative cache size: 42, Negative conditional cache size: 7, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1253 ], Independence queries for same thread: 10, Persistent sets #1 benchmarks: Persistent set computation time: 47.5s, Number of persistent set computation: 275, Number of trivial persistent sets: 153, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 563, independent: 528, independent conditional: 0, independent unconditional: 528, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1702, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 72, dependent conditional: 36, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1692, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 62, dependent conditional: 27, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1692, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 62, dependent conditional: 27, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1692, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 62, dependent conditional: 27, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 304, dependent conditional: 234, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 542, independent conditional: 14, independent unconditional: 528, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58715, independent: 9003, independent conditional: 8837, independent unconditional: 165, dependent: 49712, dependent conditional: 2522, dependent unconditional: 47190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1934, independent: 1088, independent conditional: 48, independent unconditional: 1040, dependent: 262, dependent conditional: 14, dependent unconditional: 248, unknown: 584, unknown conditional: 21, unknown unconditional: 563] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 542, Positive conditional cache size: 14, Positive unconditional cache size: 528, Negative cache size: 42, Negative conditional cache size: 7, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1253, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 1102, independent unconditional: 528, dependent: 304, dependent conditional: 234, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1934, independent: 1630, independent conditional: 62, independent unconditional: 1568, dependent: 304, dependent conditional: 21, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, independent: 542, independent conditional: 14, independent unconditional: 528, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58715, independent: 9003, independent conditional: 8837, independent unconditional: 165, dependent: 49712, dependent conditional: 2522, dependent unconditional: 47190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1934, independent: 1088, independent conditional: 48, independent unconditional: 1040, dependent: 262, dependent conditional: 14, dependent unconditional: 248, unknown: 584, unknown conditional: 21, unknown unconditional: 563] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 542, Positive conditional cache size: 14, Positive unconditional cache size: 528, Negative cache size: 42, Negative conditional cache size: 7, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1253 ], Independence queries for same thread: 10
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p1_EAX = 0;
[L715] 0 int __unbuffered_p1_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L721] 0 int y = 0;
[L722] 0 _Bool y$flush_delayed;
[L723] 0 int y$mem_tmp;
[L724] 0 _Bool y$r_buff0_thd0;
[L725] 0 _Bool y$r_buff0_thd1;
[L726] 0 _Bool y$r_buff0_thd2;
[L727] 0 _Bool y$r_buff0_thd3;
[L728] 0 _Bool y$r_buff1_thd0;
[L729] 0 _Bool y$r_buff1_thd1;
[L730] 0 _Bool y$r_buff1_thd2;
[L731] 0 _Bool y$r_buff1_thd3;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L833] 0 pthread_t t1687;
[L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L835] 0 pthread_t t1688;
[L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, t1688=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L763] 2 y$w_buff1 = y$w_buff0
[L764] 2 y$w_buff0 = 2
[L765] 2 y$w_buff1_used = y$w_buff0_used
[L766] 2 y$w_buff0_used = (_Bool)1
[L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3
[L772] 2 y$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 y$flush_delayed = weak$$choice2
[L778] 2 y$mem_tmp = y
[L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EAX = y
[L787] 2 y = y$flush_delayed ? y$mem_tmp : y
[L788] 2 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L791] 2 __unbuffered_p1_EBX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L837] 0 pthread_t t1689;
[L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L808] 3 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L820] 3 return 0;
[L743] 1 __unbuffered_p0_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L746] 1 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L803] 2 return 0;
[L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L842] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L842] RET 0 assume_abort_if_not(main$tmp_guard0)
[L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L851] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L852] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L853] 0 y$flush_delayed = weak$$choice2
[L854] 0 y$mem_tmp = y
[L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
[L863] 0 y = y$flush_delayed ? y$mem_tmp : y
[L864] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L866] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 836]: 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: 838]: 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: 834]: 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: ULTIMATE.start with 1 thread instances
CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 68.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 59.3s, 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: 25, 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.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 1118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: ConditionalCommutativityOverallTime: 4.0s, ConditionalCommutativityCheckTime: 4.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 10, ConditionalCommutativityTraceChecks: 5, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-16 09:33:29,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0
[2024-10-16 09:33:29,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...