This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-16 13:04:45,428 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-16 13:04:45,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-16 13:04:45,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-16 13:04:45,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-16 13:04:45,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-16 13:04:45,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-16 13:04:45,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-16 13:04:45,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-16 13:04:45,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-16 13:04:45,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-16 13:04:45,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-16 13:04:45,556 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-16 13:04:45,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-16 13:04:45,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-16 13:04:45,559 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-16 13:04:45,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-16 13:04:45,560 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-16 13:04:45,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-16 13:04:45,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-16 13:04:45,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-16 13:04:45,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-16 13:04:45,563 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-16 13:04:45,563 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-16 13:04:45,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-16 13:04:45,564 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-16 13:04:45,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-16 13:04:45,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-16 13:04:45,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-16 13:04:45,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-16 13:04:45,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 13:04:45,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-16 13:04:45,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-16 13:04:45,567 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-16 13:04:45,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-16 13:04:45,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-16 13:04:45,567 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-16 13:04:45,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-16 13:04:45,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-16 13:04:45,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-16 13:04:45,569 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-16 13:04:45,569 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 -> 62e921ac3b02bdecb866366797768eb8fcdb22a87147dc14adf7fddb42ab9cb2
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 -> SYMBOLIC_RELATION
[2024-10-16 13:04:45,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-16 13:04:45,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-16 13:04:45,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-16 13:04:45,932 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-16 13:04:45,932 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-16 13:04:45,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i
[2024-10-16 13:04:47,442 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-16 13:04:47,690 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-16 13:04:47,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.i
[2024-10-16 13:04:47,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aadbe26e3/63e17fcdfc0b4ec3b861317ca1a68fbf/FLAG29d424f9c
[2024-10-16 13:04:47,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/aadbe26e3/63e17fcdfc0b4ec3b861317ca1a68fbf
[2024-10-16 13:04:47,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-16 13:04:47,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-16 13:04:47,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-16 13:04:47,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-16 13:04:47,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-16 13:04:47,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:04:47" (1/1) ...
[2024-10-16 13:04:47,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbfa893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:47, skipping insertion in model container
[2024-10-16 13:04:47,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:04:47" (1/1) ...
[2024-10-16 13:04:47,792 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-16 13:04:48,007 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/rfi007_tso.i[944,957]
[2024-10-16 13:04:48,211 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-16 13:04:48,223 INFO L200 MainTranslator]: Completed pre-run
[2024-10-16 13:04:48,235 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/rfi007_tso.i[944,957]
[2024-10-16 13:04:48,290 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-16 13:04:48,333 INFO L204 MainTranslator]: Completed translation
[2024-10-16 13:04:48,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48 WrapperNode
[2024-10-16 13:04:48,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-16 13:04:48,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-16 13:04:48,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-16 13:04:48,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-16 13:04:48,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,401 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2024-10-16 13:04:48,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-16 13:04:48,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-16 13:04:48,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-16 13:04:48,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-16 13:04:48,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-16 13:04:48,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-16 13:04:48,435 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-16 13:04:48,435 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-16 13:04:48,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (1/1) ...
[2024-10-16 13:04:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 13:04:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 13:04:48,471 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 13:04:48,473 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 13:04:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-16 13:04:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-16 13:04:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-16 13:04:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-16 13:04:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-16 13:04:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-16 13:04:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-16 13:04:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-16 13:04:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-16 13:04:48,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-16 13:04:48,510 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 13:04:48,622 INFO L238 CfgBuilder]: Building ICFG
[2024-10-16 13:04:48,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-16 13:04:48,931 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-16 13:04:48,932 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-16 13:04:49,136 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-16 13:04:49,139 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-16 13:04:49,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:04:49 BoogieIcfgContainer
[2024-10-16 13:04:49,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-16 13:04:49,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-16 13:04:49,141 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-16 13:04:49,145 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-16 13:04:49,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:04:47" (1/3) ...
[2024-10-16 13:04:49,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434f7521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:04:49, skipping insertion in model container
[2024-10-16 13:04:49,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:04:48" (2/3) ...
[2024-10-16 13:04:49,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434f7521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:04:49, skipping insertion in model container
[2024-10-16 13:04:49,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:04:49" (3/3) ...
[2024-10-16 13:04:49,149 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i
[2024-10-16 13:04:49,161 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-16 13:04:49,161 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-16 13:04:49,161 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-16 13:04:49,201 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-16 13:04:49,245 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-16 13:04:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-16 13:04:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 13:04:49,247 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 13:04:49,249 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 13:04:49,347 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-16 13:04:49,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:04:49,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-16 13:04:49,382 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;@235f7ac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-16 13:04:49,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations.
[2024-10-16 13:04:56,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-16 13:04:56,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:04:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1341770786, now seen corresponding path program 1 times
[2024-10-16 13:04:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:04:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747564015]
[2024-10-16 13:04:56,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:04:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:04:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:04:57,270 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 13:04:57,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:04:57,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747564015]
[2024-10-16 13:04:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747564015] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:04:57,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:04:57,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-16 13:04:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801878345]
[2024-10-16 13:04:57,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:04:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-16 13:04:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:04:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-16 13:04:57,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-16 13:04:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:04:57,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:04:57,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 13:04:57,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:05:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:42,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-16 13:05:42,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-16 13:05:42,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:05:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2139049730, now seen corresponding path program 1 times
[2024-10-16 13:05:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:05:42,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225923486]
[2024-10-16 13:05:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:05:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:05:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:05:42,467 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 13:05:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:05:42,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225923486]
[2024-10-16 13:05:42,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225923486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:05:42,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:05:42,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-16 13:05:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863179899]
[2024-10-16 13:05:42,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:05:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-16 13:05:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:05:42,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-16 13:05:42,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-16 13:05:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:05:42,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:05:42,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 13:05:42,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:42,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:05:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:42,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-16 13:05:42,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-16 13:05:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 698746790, now seen corresponding path program 1 times
[2024-10-16 13:05:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:05:42,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:05:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:42,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:05:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:42,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:05:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1967587080, now seen corresponding path program 1 times
[2024-10-16 13:05:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:05:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986482411]
[2024-10-16 13:05:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:05:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:05:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:05:45,504 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 13:05:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:05:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986482411]
[2024-10-16 13:05:45,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986482411] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:05:45,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:05:45,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-16 13:05:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716630908]
[2024-10-16 13:05:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:05:45,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-16 13:05:45,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:05:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-16 13:05:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-10-16 13:05:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:05:45,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:05:45,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 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 13:05:45,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:45,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:45,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:05:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-16 13:05:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-10-16 13:05:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2
[2024-10-16 13:05:53,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2024-10-16 13:05:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 921739622, now seen corresponding path program 1 times
[2024-10-16 13:05:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:05:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:05:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:55,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:05:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1937318326, now seen corresponding path program 1 times
[2024-10-16 13:05:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:05:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:05:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:55,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:05:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:05:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1754257176, now seen corresponding path program 2 times
[2024-10-16 13:05:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:05:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990900000]
[2024-10-16 13:05:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:05:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:05:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:55,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:05:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:05:55,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-16 13:05:55,588 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-16 13:05:55,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining)
[2024-10-16 13:05:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining)
[2024-10-16 13:05:55,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining)
[2024-10-16 13:05:55,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5
[2024-10-16 13:05:55,604 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1]
[2024-10-16 13:05:55,608 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (1/2)
[2024-10-16 13:05:55,674 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-16 13:05:55,676 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-16 13:05:55,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:05:55 BasicIcfg
[2024-10-16 13:05:55,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-16 13:05:55,681 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-16 13:05:55,685 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-16 13:05:55,685 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-16 13:05:55,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:04:49" (3/4) ...
[2024-10-16 13:05:55,687 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-16 13:05:55,778 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-16 13:05:55,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-16 13:05:55,781 INFO L158 Benchmark]: Toolchain (without parser) took 68055.12ms. Allocated memory was 83.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 49.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,782 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-16 13:05:55,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.02ms. Allocated memory is still 83.9MB. Free memory was 49.0MB in the beginning and 44.2MB in the end (delta: 4.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.96ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 41.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,783 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 39.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,783 INFO L158 Benchmark]: RCFGBuilder took 704.22ms. Allocated memory is still 83.9MB. Free memory was 39.0MB in the beginning and 49.2MB in the end (delta: -10.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,783 INFO L158 Benchmark]: TraceAbstraction took 66539.32ms. Allocated memory was 83.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.2MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,783 INFO L158 Benchmark]: Witness Printer took 99.95ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-10-16 13:05:55,785 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.19ms. Allocated memory is still 52.4MB. Free memory was 28.7MB in the beginning and 28.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 606.02ms. Allocated memory is still 83.9MB. Free memory was 49.0MB in the beginning and 44.2MB in the end (delta: 4.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 66.96ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 41.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 32.22ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 39.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 704.22ms. Allocated memory is still 83.9MB. Free memory was 39.0MB in the beginning and 49.2MB in the end (delta: -10.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 66539.32ms. Allocated memory was 83.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.2MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB.
* Witness Printer took 99.95ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 575, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 48, dependent conditional: 23, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 567, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 40, dependent conditional: 16, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 567, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 40, dependent conditional: 16, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 567, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 40, dependent conditional: 16, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 109, dependent conditional: 61, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 299, independent: 267, independent conditional: 3, independent unconditional: 264, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59759, independent: 138, independent conditional: 50, independent unconditional: 87, dependent: 59621, dependent conditional: 13636, dependent unconditional: 45985, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 636, independent: 260, independent conditional: 2, independent unconditional: 258, dependent: 77, dependent conditional: 8, dependent unconditional: 69, unknown: 299, unknown conditional: 11, unknown unconditional: 288] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 267, Positive conditional cache size: 3, Positive unconditional cache size: 264, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 303, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 109, dependent conditional: 61, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 299, independent: 267, independent conditional: 3, independent unconditional: 264, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59759, independent: 138, independent conditional: 50, independent unconditional: 87, dependent: 59621, dependent conditional: 13636, dependent unconditional: 45985, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 636, independent: 260, independent conditional: 2, independent unconditional: 258, dependent: 77, dependent conditional: 8, dependent unconditional: 69, unknown: 299, unknown conditional: 11, unknown unconditional: 288] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 267, Positive conditional cache size: 3, Positive unconditional cache size: 264, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 303 ], Independence queries for same thread: 8, Persistent sets #1 benchmarks: Persistent set computation time: 46.1s, Number of persistent set computation: 94, Number of trivial persistent sets: 44, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 288, independent: 264, independent conditional: 0, independent unconditional: 264, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 575, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 48, dependent conditional: 23, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 567, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 40, dependent conditional: 16, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 567, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 40, dependent conditional: 16, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 567, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 40, dependent conditional: 16, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 109, dependent conditional: 61, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 299, independent: 267, independent conditional: 3, independent unconditional: 264, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59759, independent: 138, independent conditional: 50, independent unconditional: 87, dependent: 59621, dependent conditional: 13636, dependent unconditional: 45985, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 636, independent: 260, independent conditional: 2, independent unconditional: 258, dependent: 77, dependent conditional: 8, dependent unconditional: 69, unknown: 299, unknown conditional: 11, unknown unconditional: 288] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 267, Positive conditional cache size: 3, Positive unconditional cache size: 264, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 303, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 263, independent unconditional: 264, dependent: 109, dependent conditional: 61, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 636, independent: 527, independent conditional: 5, independent unconditional: 522, dependent: 109, dependent conditional: 16, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 299, independent: 267, independent conditional: 3, independent unconditional: 264, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59759, independent: 138, independent conditional: 50, independent unconditional: 87, dependent: 59621, dependent conditional: 13636, dependent unconditional: 45985, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 636, independent: 260, independent conditional: 2, independent unconditional: 258, dependent: 77, dependent conditional: 8, dependent unconditional: 69, unknown: 299, unknown conditional: 11, unknown unconditional: 288] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 267, Positive conditional cache size: 3, Positive unconditional cache size: 264, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 303 ], Independence queries for same thread: 8
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L718] 0 int y = 0;
[L719] 0 _Bool y$flush_delayed;
[L720] 0 int y$mem_tmp;
[L721] 0 _Bool y$r_buff0_thd0;
[L722] 0 _Bool y$r_buff0_thd1;
[L723] 0 _Bool y$r_buff0_thd2;
[L724] 0 _Bool y$r_buff1_thd0;
[L725] 0 _Bool y$r_buff1_thd1;
[L726] 0 _Bool y$r_buff1_thd2;
[L727] 0 _Bool y$read_delayed;
[L728] 0 int *y$read_delayed_var;
[L729] 0 int y$w_buff0;
[L730] 0 _Bool y$w_buff0_used;
[L731] 0 int y$w_buff1;
[L732] 0 _Bool y$w_buff1_used;
[L733] 0 _Bool weak$$choice0;
[L734] 0 _Bool weak$$choice2;
[L810] 0 pthread_t t1717;
[L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1717=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L812] 0 pthread_t t1718;
[L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1717=-1, t1718=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L758] 2 y$w_buff1 = y$w_buff0
[L759] 2 y$w_buff0 = 2
[L760] 2 y$w_buff1_used = y$w_buff0_used
[L761] 2 y$w_buff0_used = (_Bool)1
[L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L766] 2 y$r_buff0_thd2 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L769] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L770] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L771] 2 y$flush_delayed = weak$$choice2
[L772] 2 y$mem_tmp = y
[L773] 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)
[L774] 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))
[L775] 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))
[L776] 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))
[L777] 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))
[L778] 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))
[L779] 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))
[L780] 2 __unbuffered_p1_EAX = y
[L781] 2 y = y$flush_delayed ? y$mem_tmp : y
[L782] 2 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L785] 2 __unbuffered_p1_EBX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L738] 1 x = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L741] 1 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L788] 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)
[L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L790] 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
[L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L792] 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}, __unbuffered_cnt=0, __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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L797] 2 return 0;
[L744] 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)
[L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L746] 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
[L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L748] 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}, __unbuffered_cnt=1, __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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717=-1, t1718=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L817] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L817] RET 0 assume_abort_if_not(main$tmp_guard0)
[L819] 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)
[L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L821] 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
[L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L823] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717=-1, t1718=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L826] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L827] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L828] 0 y$flush_delayed = weak$$choice2
[L829] 0 y$mem_tmp = y
[L830] 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)
[L831] 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))
[L832] 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))
[L833] 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))
[L834] 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))
[L835] 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))
[L836] 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))
[L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
[L838] 0 y = y$flush_delayed ? y$mem_tmp : y
[L839] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717=-1, t1718=0, weak$$choice0=1, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L841] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 811]: 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: 813]: 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 5 procedures, 49 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 66.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 60.4s, 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: 20, 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, 3.3s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 1.8s, ConditionalCommutativityCheckTime: 1.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 0, ConditionalCommutativityConditionCalculations: 7, ConditionalCommutativityTraceChecks: 3, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-16 13:05:55,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-10-16 13:05:56,011 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...