This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 12:44:41,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 12:44:41,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 12:44:41,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 12:44:41,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 12:44:41,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 12:44:41,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 12:44:41,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 12:44:41,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 12:44:41,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 12:44:41,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 12:44:41,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 12:44:41,406 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 12:44:41,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 12:44:41,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 12:44:41,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 12:44:41,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 12:44:41,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 12:44:41,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 12:44:41,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 12:44:41,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 12:44:41,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 12:44:41,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 12:44:41,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 12:44:41,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 12:44:41,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 12:44:41,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 12:44:41,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 12:44:41,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 12:44:41,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 12:44:41,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 12:44:41,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 12:44:41,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 12:44:41,413 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 12:44:41,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 12:44:41,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 12:44:41,414 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 12:44:41,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 12:44:41,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 12:44:41,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 12:44:41,417 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 12:44:41,417 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf 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 12:44:41,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 12:44:41,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 12:44:41,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 12:44:41,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 12:44:41,711 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 12:44:41,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2024-10-16 12:44:43,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 12:44:43,273 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 12:44:43,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2024-10-16 12:44:43,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5129a29e6/a5f30c3b6a724a20865a74daf5634eba/FLAG70be0bd7d [2024-10-16 12:44:43,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5129a29e6/a5f30c3b6a724a20865a74daf5634eba [2024-10-16 12:44:43,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 12:44:43,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 12:44:43,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 12:44:43,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 12:44:43,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 12:44:43,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735a19db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43, skipping insertion in model container [2024-10-16 12:44:43,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 12:44:43,519 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/mix018_tso.oepc.i[949,962] [2024-10-16 12:44:43,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 12:44:43,700 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 12:44:43,710 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/mix018_tso.oepc.i[949,962] [2024-10-16 12:44:43,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 12:44:43,797 INFO L204 MainTranslator]: Completed translation [2024-10-16 12:44:43,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43 WrapperNode [2024-10-16 12:44:43,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 12:44:43,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 12:44:43,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 12:44:43,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 12:44:43,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,859 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2024-10-16 12:44:43,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 12:44:43,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 12:44:43,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 12:44:43,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 12:44:43,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 12:44:43,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 12:44:43,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 12:44:43,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 12:44:43,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (1/1) ... [2024-10-16 12:44:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 12:44:43,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 12:44:43,942 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 12:44:43,947 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 12:44:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-16 12:44:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 12:44:43,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-16 12:44:43,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-16 12:44:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-16 12:44:43,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-16 12:44:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-16 12:44:43,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-16 12:44:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-16 12:44:43,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-16 12:44:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 12:44:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-16 12:44:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 12:44:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 12:44:43,988 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 12:44:44,125 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 12:44:44,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 12:44:44,406 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 12:44:44,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 12:44:44,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 12:44:44,556 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-16 12:44:44,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:44:44 BoogieIcfgContainer [2024-10-16 12:44:44,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 12:44:44,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 12:44:44,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 12:44:44,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 12:44:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:44:43" (1/3) ... [2024-10-16 12:44:44,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db2223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:44:44, skipping insertion in model container [2024-10-16 12:44:44,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:44:43" (2/3) ... [2024-10-16 12:44:44,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db2223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:44:44, skipping insertion in model container [2024-10-16 12:44:44,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:44:44" (3/3) ... [2024-10-16 12:44:44,563 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2024-10-16 12:44:44,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 12:44:44,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-16 12:44:44,576 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 12:44:44,617 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 12:44:44,656 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 12:44:44,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 12:44:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 12:44:44,658 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 12:44:44,659 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 12:44:44,738 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 12:44:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 12:44:44,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 12:44:44,775 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;@801dd9b, 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 12:44:44,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-16 12:45:02,642 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 2 more)] === [2024-10-16 12:45:02,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 12:45:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1150612282, now seen corresponding path program 1 times [2024-10-16 12:45:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 12:45:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580105026] [2024-10-16 12:45:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:03,410 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 12:45:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 12:45:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580105026] [2024-10-16 12:45:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580105026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 12:45:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 12:45:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 12:45:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194536607] [2024-10-16 12:45:03,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 12:45:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 12:45:03,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 12:45:03,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 12:45:03,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 12:45:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:03,443 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 12:45:03,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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 12:45:03,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:13,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-16 12:45:13,365 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 2 more)] === [2024-10-16 12:45:13,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 12:45:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 593817815, now seen corresponding path program 1 times [2024-10-16 12:45:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 12:45:13,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792005060] [2024-10-16 12:45:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:13,726 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 12:45:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 12:45:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792005060] [2024-10-16 12:45:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792005060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 12:45:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 12:45:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-16 12:45:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905387173] [2024-10-16 12:45:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 12:45:13,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-16 12:45:13,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 12:45:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-16 12:45:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-16 12:45:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:13,729 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 12:45:13,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 12:45:13,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:13,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:16,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-16 12:45:16,086 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 2 more)] === [2024-10-16 12:45:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1002447542, now seen corresponding path program 1 times [2024-10-16 12:45:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:16,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 12:45:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:16,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 12:45:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1474407505, now seen corresponding path program 1 times [2024-10-16 12:45:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 12:45:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441722364] [2024-10-16 12:45:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:17,769 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 12:45:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 12:45:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441722364] [2024-10-16 12:45:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441722364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 12:45:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 12:45:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-16 12:45:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802902120] [2024-10-16 12:45:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 12:45:17,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-16 12:45:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 12:45:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-16 12:45:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-16 12:45:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:17,771 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 12:45:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 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 12:45:17,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:17,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:17,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 12:45:24,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-10-16 12:45:24,659 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 2 more)] === [2024-10-16 12:45:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1328798248, now seen corresponding path program 1 times [2024-10-16 12:45:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:26,077 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 12:45:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:26,229 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 12:45:26,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 12:45:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 12:45:26,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-16 12:45:26,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:26,231 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 12:45:26,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 12:45:26,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:26,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:26,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 12:45:26,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 12:45:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:38,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5 [2024-10-16 12:45:38,840 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 2 more)] === [2024-10-16 12:45:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1367686296, now seen corresponding path program 1 times [2024-10-16 12:45:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:40,189 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 12:45:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:40,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 12:45:40,345 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 12:45:40,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 12:45:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 12:45:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-16 12:45:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:40,347 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 12:45:40,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 12:45:40,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:40,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:40,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 12:45:40,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:40,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 12:45:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 12:45:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 12:45:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:58,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 12:45:58,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2024-10-16 12:45:58,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-16 12:45:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1465506223, now seen corresponding path program 1 times [2024-10-16 12:45:59,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:59,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:59,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 12:45:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 944231506, now seen corresponding path program 1 times [2024-10-16 12:45:59,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:59,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 12:45:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 12:45:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1072434479, now seen corresponding path program 2 times [2024-10-16 12:45:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 12:45:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063553373] [2024-10-16 12:45:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 12:45:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 12:45:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:45:59,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 12:46:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 12:46:00,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 12:46:00,052 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 12:46:00,054 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-10-16 12:46:00,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-10-16 12:46:00,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-16 12:46:00,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-10-16 12:46:00,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-10-16 12:46:00,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-10-16 12:46:00,068 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-16 12:46:00,071 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-10-16 12:46:00,160 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-16 12:46:00,160 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-16 12:46:00,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:46:00 BasicIcfg [2024-10-16 12:46:00,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-16 12:46:00,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-16 12:46:00,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-16 12:46:00,166 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-16 12:46:00,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:44:44" (3/4) ... [2024-10-16 12:46:00,167 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-16 12:46:00,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-16 12:46:00,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-16 12:46:00,259 INFO L158 Benchmark]: Toolchain (without parser) took 76956.90ms. Allocated memory was 71.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 32.2MB in the beginning and 646.8MB in the end (delta: -614.6MB). Peak memory consumption was 815.5MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,259 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-16 12:46:00,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.57ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 32.0MB in the beginning and 100.9MB in the end (delta: -69.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.77ms. Allocated memory is still 125.8MB. Free memory was 100.9MB in the beginning and 98.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,259 INFO L158 Benchmark]: Boogie Preprocessor took 34.83ms. Allocated memory is still 125.8MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,260 INFO L158 Benchmark]: RCFGBuilder took 657.95ms. Allocated memory is still 125.8MB. Free memory was 95.7MB in the beginning and 74.4MB in the end (delta: 21.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,260 INFO L158 Benchmark]: TraceAbstraction took 75607.33ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 73.0MB in the beginning and 666.7MB in the end (delta: -593.7MB). Peak memory consumption was 781.4MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,260 INFO L158 Benchmark]: Witness Printer took 92.57ms. Allocated memory is still 1.5GB. Free memory was 666.7MB in the beginning and 646.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-16 12:46:00,261 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.23ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 47.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.57ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 32.0MB in the beginning and 100.9MB in the end (delta: -69.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.77ms. Allocated memory is still 125.8MB. Free memory was 100.9MB in the beginning and 98.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.83ms. Allocated memory is still 125.8MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 657.95ms. Allocated memory is still 125.8MB. Free memory was 95.7MB in the beginning and 74.4MB in the end (delta: 21.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75607.33ms. Allocated memory was 125.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 73.0MB in the beginning and 666.7MB in the end (delta: -593.7MB). Peak memory consumption was 781.4MB. Max. memory is 16.1GB. * Witness Printer took 92.57ms. Allocated memory is still 1.5GB. Free memory was 666.7MB in the beginning and 646.8MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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: 11616, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 165, dependent conditional: 115, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11604, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 153, dependent conditional: 104, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11604, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 153, dependent conditional: 104, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11604, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 153, dependent conditional: 104, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 2532, dependent conditional: 2434, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, independent: 1096, independent conditional: 28, independent unconditional: 1068, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67551, independent: 17934, independent conditional: 17743, independent unconditional: 191, dependent: 49617, dependent conditional: 1349, dependent unconditional: 48268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13983, independent: 10355, independent conditional: 713, independent unconditional: 9642, dependent: 2474, dependent conditional: 25, dependent unconditional: 2449, unknown: 1154, unknown conditional: 37, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1096, Positive conditional cache size: 28, Positive unconditional cache size: 1068, Negative cache size: 58, Negative conditional cache size: 9, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12042, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 2532, dependent conditional: 2434, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, independent: 1096, independent conditional: 28, independent unconditional: 1068, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67551, independent: 17934, independent conditional: 17743, independent unconditional: 191, dependent: 49617, dependent conditional: 1349, dependent unconditional: 48268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13983, independent: 10355, independent conditional: 713, independent unconditional: 9642, dependent: 2474, dependent conditional: 25, dependent unconditional: 2449, unknown: 1154, unknown conditional: 37, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1096, Positive conditional cache size: 28, Positive unconditional cache size: 1068, Negative cache size: 58, Negative conditional cache size: 9, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12042 ], Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 48.6s, Number of persistent set computation: 2044, Number of trivial persistent sets: 1309, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1117, independent: 1068, independent conditional: 0, independent unconditional: 1068, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11616, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 165, dependent conditional: 115, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11604, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 153, dependent conditional: 104, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11604, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 153, dependent conditional: 104, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11604, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 153, dependent conditional: 104, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 2532, dependent conditional: 2434, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, independent: 1096, independent conditional: 28, independent unconditional: 1068, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67551, independent: 17934, independent conditional: 17743, independent unconditional: 191, dependent: 49617, dependent conditional: 1349, dependent unconditional: 48268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13983, independent: 10355, independent conditional: 713, independent unconditional: 9642, dependent: 2474, dependent conditional: 25, dependent unconditional: 2449, unknown: 1154, unknown conditional: 37, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1096, Positive conditional cache size: 28, Positive unconditional cache size: 1068, Negative cache size: 58, Negative conditional cache size: 9, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12042, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 10383, independent unconditional: 1068, dependent: 2532, dependent conditional: 2434, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13983, independent: 11451, independent conditional: 741, independent unconditional: 10710, dependent: 2532, dependent conditional: 34, dependent unconditional: 2498, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, independent: 1096, independent conditional: 28, independent unconditional: 1068, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 58, dependent conditional: 9, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67551, independent: 17934, independent conditional: 17743, independent unconditional: 191, dependent: 49617, dependent conditional: 1349, dependent unconditional: 48268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13983, independent: 10355, independent conditional: 713, independent unconditional: 9642, dependent: 2474, dependent conditional: 25, dependent unconditional: 2449, unknown: 1154, unknown conditional: 37, unknown unconditional: 1117] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1096, Positive conditional cache size: 28, Positive unconditional cache size: 1068, Negative cache size: 58, Negative conditional cache size: 9, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12042 ], Independence queries for same thread: 12 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, t490=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, t490=0, t491=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L817] 3 return 0; [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L838] 4 __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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L840] 4 return 0; [L752] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489=-1, t490=0, t491=1, t492=2, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 856]: 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: 854]: 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: 858]: 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: 860]: 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 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 75.3s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 67.9s, 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.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 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: 4.6s, ConditionalCommutativityCheckTime: 4.6s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 2, ConditionalCommutativityConditionCalculations: 11, ConditionalCommutativityTraceChecks: 5, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-10-16 12:46:00,295 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 12:46:00,490 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...