/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-16 00:30:02,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 00:30:02,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-16 00:30:02,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 00:30:02,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 00:30:02,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 00:30:02,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 00:30:02,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 00:30:02,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 00:30:02,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 00:30:02,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 00:30:02,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 00:30:02,261 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 00:30:02,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 00:30:02,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 00:30:02,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 00:30:02,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 00:30:02,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-16 00:30:02,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-16 00:30:02,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-16 00:30:02,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 00:30:02,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 00:30:02,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 00:30:02,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 00:30:02,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 00:30:02,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2024-11-16 00:30:03,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 00:30:03,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 00:30:03,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i [2024-11-16 00:30:03,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b21d71bd2/ab4d86d811a041d194adc4dddda7ae8b/FLAG5bee3f239 [2024-11-16 00:30:04,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b21d71bd2/ab4d86d811a041d194adc4dddda7ae8b [2024-11-16 00:30:04,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 00:30:04,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-16 00:30:04,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 00:30:04,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 00:30:04,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 00:30:04,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aaffe39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04, skipping insertion in model container [2024-11-16 00:30:04,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 00:30:04,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2024-11-16 00:30:04,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2024-11-16 00:30:04,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 00:30:04,448 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 00:30:04,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30440,30453] [2024-11-16 00:30:04,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-deagle/circular_buffer_bad.i[30895,30908] [2024-11-16 00:30:04,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 00:30:04,501 INFO L204 MainTranslator]: Completed translation [2024-11-16 00:30:04,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04 WrapperNode [2024-11-16 00:30:04,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 00:30:04,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 00:30:04,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 00:30:04,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 00:30:04,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,531 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-11-16 00:30:04,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 00:30:04,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 00:30:04,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 00:30:04,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 00:30:04,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 00:30:04,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-16 00:30:04,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-16 00:30:04,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-16 00:30:04,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (1/1) ... [2024-11-16 00:30:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-16 00:30:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-16 00:30:04,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-16 00:30:04,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-16 00:30:04,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-16 00:30:04,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 00:30:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 00:30:04,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 00:30:04,594 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 00:30:04,694 INFO L238 CfgBuilder]: Building ICFG [2024-11-16 00:30:04,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 00:30:04,921 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 00:30:04,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-16 00:30:04,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 00:30:04,942 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 00:30:04,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:04 BoogieIcfgContainer [2024-11-16 00:30:04,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-16 00:30:04,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 00:30:04,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 00:30:04,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 00:30:04,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:04" (1/3) ... [2024-11-16 00:30:04,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412eed56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:04, skipping insertion in model container [2024-11-16 00:30:04,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:04" (2/3) ... [2024-11-16 00:30:04,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412eed56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:04, skipping insertion in model container [2024-11-16 00:30:04,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:04" (3/3) ... [2024-11-16 00:30:04,950 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-16 00:30:04,961 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 00:30:04,962 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 139 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-16 00:30:04,962 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 00:30:05,053 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 00:30:05,092 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 00:30:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-16 00:30:05,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-16 00:30:05,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-16 00:30:05,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-16 00:30:05,161 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-16 00:30:05,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-16 00:30:05,176 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;@41aba122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 00:30:05,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 00:30:06,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 00:30:06,292 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-16 00:30:06,293 INFO L132 ounterexampleChecker]: Examining path program with hash 1445716617, occurence #1 [2024-11-16 00:30:06,293 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-16 00:30:06,293 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-16 00:30:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 00:30:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash 800288606, now seen corresponding path program 1 times [2024-11-16 00:30:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 00:30:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911995782] [2024-11-16 00:30:06,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 00:30:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 00:30:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 00:30:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 00:30:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911995782] [2024-11-16 00:30:07,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911995782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 00:30:07,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 00:30:07,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 00:30:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032082288] [2024-11-16 00:30:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 00:30:07,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 00:30:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 00:30:07,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 00:30:07,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 00:30:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:07,060 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-16 00:30:07,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-11-16 00:30:07,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 00:30:08,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 00:30:08,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 00:30:08,711 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-16 00:30:08,713 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-11-16 00:30:08,721 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 00:30:08,722 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-16 00:30:08,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-16 00:30:08,723 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;@41aba122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 00:30:08,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 00:30:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-16 00:30:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-16 00:30:08,737 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-16 00:30:08,737 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2024-11-16 00:30:08,740 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 00:30:08,742 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-16 00:30:08,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-16 00:30:08,742 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;@41aba122, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 00:30:08,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 00:30:08,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 00:30:08,776 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-16 00:30:08,777 INFO L132 ounterexampleChecker]: Examining path program with hash 1839407572, occurence #1 [2024-11-16 00:30:08,777 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-16 00:30:08,777 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-16 00:30:08,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 00:30:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1509035455, now seen corresponding path program 1 times [2024-11-16 00:30:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 00:30:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708805633] [2024-11-16 00:30:08,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 00:30:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 00:30:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 00:30:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 00:30:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708805633] [2024-11-16 00:30:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708805633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 00:30:09,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 00:30:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 00:30:09,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629867469] [2024-11-16 00:30:09,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 00:30:09,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 00:30:09,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 00:30:09,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 00:30:09,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-16 00:30:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:09,910 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-16 00:30:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 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-11-16 00:30:09,910 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:10,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 00:30:10,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 00:30:10,860 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-16 00:30:10,861 INFO L132 ounterexampleChecker]: Examining path program with hash -729032962, occurence #1 [2024-11-16 00:30:10,861 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-16 00:30:10,861 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-16 00:30:10,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 00:30:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1841531157, now seen corresponding path program 1 times [2024-11-16 00:30:10,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 00:30:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743607909] [2024-11-16 00:30:10,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 00:30:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 00:30:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-16 00:30:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 00:30:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743607909] [2024-11-16 00:30:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743607909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 00:30:11,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 00:30:11,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 00:30:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297604323] [2024-11-16 00:30:11,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 00:30:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 00:30:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 00:30:11,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 00:30:11,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 00:30:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:11,066 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-16 00:30:11,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-11-16 00:30:11,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:11,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 00:30:11,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 00:30:11,110 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-16 00:30:11,110 INFO L132 ounterexampleChecker]: Examining path program with hash -1299188638, occurence #1 [2024-11-16 00:30:11,111 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-16 00:30:11,111 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-16 00:30:11,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 00:30:11,112 INFO L85 PathProgramCache]: Analyzing trace with hash -973710883, now seen corresponding path program 2 times [2024-11-16 00:30:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 00:30:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322303480] [2024-11-16 00:30:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 00:30:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 00:30:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-16 00:30:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 00:30:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322303480] [2024-11-16 00:30:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322303480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 00:30:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 00:30:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 00:30:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292899354] [2024-11-16 00:30:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 00:30:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 00:30:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 00:30:11,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 00:30:11,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 00:30:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:11,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-16 00:30:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-11-16 00:30:11,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 00:30:11,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 00:30:11,345 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-16 00:30:11,345 INFO L132 ounterexampleChecker]: Examining path program with hash 235034917, occurence #1 [2024-11-16 00:30:11,345 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-16 00:30:11,345 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-16 00:30:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 00:30:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1855686656, now seen corresponding path program 1 times [2024-11-16 00:30:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 00:30:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949564283] [2024-11-16 00:30:11,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 00:30:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 00:30:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-16 00:30:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 00:30:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949564283] [2024-11-16 00:30:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949564283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 00:30:11,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 00:30:11,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 00:30:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150396481] [2024-11-16 00:30:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 00:30:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 00:30:11,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 00:30:11,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 00:30:11,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 00:30:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:11,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-16 00:30:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-11-16 00:30:11,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:11,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-16 00:30:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 00:30:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 00:30:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 00:30:11,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 00:30:11,474 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-16 00:30:11,474 INFO L132 ounterexampleChecker]: Examining path program with hash 1564956440, occurence #1 [2024-11-16 00:30:11,474 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-16 00:30:11,474 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-16 00:30:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 00:30:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1943824036, now seen corresponding path program 1 times [2024-11-16 00:30:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 00:30:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056469438] [2024-11-16 00:30:11,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 00:30:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 00:30:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324512883] [2024-11-16 00:30:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 00:30:11,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 00:30:11,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-16 00:30:11,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 00:30:11,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 00:30:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 00:30:12,053 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 00:30:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 00:30:12,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 00:30:12,361 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-16 00:30:12,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 00:30:12,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 00:30:12,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 00:30:12,563 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-16 00:30:12,563 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2024-11-16 00:30:12,660 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 00:30:12,660 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 00:30:12,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-16 00:30:12,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:30:12 BasicIcfg [2024-11-16 00:30:12,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 00:30:12,680 INFO L158 Benchmark]: Toolchain (without parser) took 8490.72ms. Allocated memory was 100.7MB in the beginning and 222.3MB in the end (delta: 121.6MB). Free memory was 72.3MB in the beginning and 93.5MB in the end (delta: -21.3MB). Peak memory consumption was 98.3MB. Max. memory is 8.0GB. [2024-11-16 00:30:12,680 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-16 00:30:12,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.76ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 51.4MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-11-16 00:30:12,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.61ms. Allocated memory is still 100.7MB. Free memory was 51.2MB in the beginning and 49.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-16 00:30:12,680 INFO L158 Benchmark]: Boogie Preprocessor took 18.15ms. Allocated memory is still 100.7MB. Free memory was 49.3MB in the beginning and 47.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-16 00:30:12,680 INFO L158 Benchmark]: RCFGBuilder took 391.49ms. Allocated memory is still 100.7MB. Free memory was 47.9MB in the beginning and 30.5MB in the end (delta: 17.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-11-16 00:30:12,681 INFO L158 Benchmark]: TraceAbstraction took 7735.42ms. Allocated memory was 100.7MB in the beginning and 222.3MB in the end (delta: 121.6MB). Free memory was 29.9MB in the beginning and 93.5MB in the end (delta: -63.6MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. [2024-11-16 00:30:12,681 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 52.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.76ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 51.4MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.61ms. Allocated memory is still 100.7MB. Free memory was 51.2MB in the beginning and 49.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.15ms. Allocated memory is still 100.7MB. Free memory was 49.3MB in the beginning and 47.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 391.49ms. Allocated memory is still 100.7MB. Free memory was 47.9MB in the beginning and 30.5MB in the end (delta: 17.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7735.42ms. Allocated memory was 100.7MB in the beginning and 222.3MB in the end (delta: 121.6MB). Free memory was 29.9MB in the beginning and 93.5MB in the end (delta: -63.6MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29868, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 1458, dependent conditional: 1440, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28572, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 162, dependent conditional: 144, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28572, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 162, dependent conditional: 144, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28716, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 306, dependent conditional: 288, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28716, independent: 28410, independent conditional: 0, independent unconditional: 28410, dependent: 306, dependent conditional: 30, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28716, independent: 28410, independent conditional: 0, independent unconditional: 28410, dependent: 306, dependent conditional: 30, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4216, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4216, independent: 4177, independent conditional: 0, independent unconditional: 4177, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1857, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 1778, dependent conditional: 809, dependent unconditional: 969, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 28716, independent: 24224, independent conditional: 0, independent unconditional: 24224, dependent: 276, dependent conditional: 20, dependent unconditional: 256, unknown: 4216, unknown conditional: 10, unknown unconditional: 4206] , Statistics on independence cache: Total cache size (in pairs): 4216, Positive cache size: 4186, Positive conditional cache size: 0, Positive unconditional cache size: 4186, Negative cache size: 30, Negative conditional cache size: 10, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22215, Maximal queried relation: 1, Independence queries for same thread: 1296, Persistent sets #1 benchmarks: Persistent set computation time: 1.3s, Number of persistent set computation: 3858, Number of trivial persistent sets: 3549, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6471, independent: 6453, independent conditional: 0, independent unconditional: 6453, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29868, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 1458, dependent conditional: 1440, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28572, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 162, dependent conditional: 144, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28572, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 162, dependent conditional: 144, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28716, independent: 28410, independent conditional: 21957, independent unconditional: 6453, dependent: 306, dependent conditional: 288, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28716, independent: 28410, independent conditional: 0, independent unconditional: 28410, dependent: 306, dependent conditional: 30, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28716, independent: 28410, independent conditional: 0, independent unconditional: 28410, dependent: 306, dependent conditional: 30, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4216, independent: 4186, independent conditional: 0, independent unconditional: 4186, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4216, independent: 4177, independent conditional: 0, independent unconditional: 4177, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 39, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1857, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 1778, dependent conditional: 809, dependent unconditional: 969, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 28716, independent: 24224, independent conditional: 0, independent unconditional: 24224, dependent: 276, dependent conditional: 20, dependent unconditional: 256, unknown: 4216, unknown conditional: 10, unknown unconditional: 4206] , Statistics on independence cache: Total cache size (in pairs): 4216, Positive cache size: 4186, Positive conditional cache size: 0, Positive unconditional cache size: 4186, Negative cache size: 30, Negative conditional cache size: 10, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22215, Maximal queried relation: 1, Independence queries for same thread: 1296 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 910, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 20, dependent conditional: 18, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 892, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 892, independent: 869, independent conditional: 0, independent unconditional: 869, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 4227, Positive cache size: 4207, Positive conditional cache size: 0, Positive unconditional cache size: 4207, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0, Independence queries for same thread: 18, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 77, Number of trivial persistent sets: 71, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 860, independent: 858, independent conditional: 0, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 910, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 20, dependent conditional: 18, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 32, independent unconditional: 858, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 892, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 892, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 892, independent: 869, independent conditional: 0, independent unconditional: 869, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 4227, Positive cache size: 4207, Positive conditional cache size: 0, Positive unconditional cache size: 4207, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0, Independence queries for same thread: 18 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7569, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 503, dependent conditional: 485, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7094, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7094, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7110, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 44, dependent conditional: 26, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7110, independent: 7066, independent conditional: 0, independent unconditional: 7066, dependent: 44, dependent conditional: 6, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7110, independent: 7066, independent conditional: 0, independent unconditional: 7066, dependent: 44, dependent conditional: 6, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 363, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 363, dependent conditional: 363, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 7110, independent: 6910, independent conditional: 0, independent unconditional: 6910, dependent: 41, dependent conditional: 3, dependent unconditional: 38, unknown: 159, unknown conditional: 3, unknown unconditional: 156] , Statistics on independence cache: Total cache size (in pairs): 4386, Positive cache size: 4363, Positive conditional cache size: 0, Positive unconditional cache size: 4363, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1662, Maximal queried relation: 4, Independence queries for same thread: 475, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 454, Number of trivial persistent sets: 389, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5442, independent: 5424, independent conditional: 0, independent unconditional: 5424, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7569, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 503, dependent conditional: 485, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7094, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7094, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7110, independent: 7066, independent conditional: 1642, independent unconditional: 5424, dependent: 44, dependent conditional: 26, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7110, independent: 7066, independent conditional: 0, independent unconditional: 7066, dependent: 44, dependent conditional: 6, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7110, independent: 7066, independent conditional: 0, independent unconditional: 7066, dependent: 44, dependent conditional: 6, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 363, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 363, dependent conditional: 363, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 7110, independent: 6910, independent conditional: 0, independent unconditional: 6910, dependent: 41, dependent conditional: 3, dependent unconditional: 38, unknown: 159, unknown conditional: 3, unknown unconditional: 156] , Statistics on independence cache: Total cache size (in pairs): 4386, Positive cache size: 4363, Positive conditional cache size: 0, Positive unconditional cache size: 4363, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1662, Maximal queried relation: 4, Independence queries for same thread: 475 - PositiveResult [Line: 713]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 static char buffer[10]; VAL [buffer={3:0}] [L683] 0 static unsigned int first; VAL [buffer={3:0}, first=0] [L684] 0 static unsigned int next; VAL [buffer={3:0}, first=0, next=0] [L685] 0 static int buffer_size; VAL [buffer={3:0}, buffer_size=0, first=0, next=0] [L686] 0 _Bool send, receive; VAL [buffer={3:0}, buffer_size=0, first=0, next=0, receive=0, send=0] [L687] 0 pthread_mutex_t m; VAL [buffer={3:0}, buffer_size=0, first=0, m={4:0}, next=0, receive=0, send=0] [L756] 0 pthread_t id1, id2; VAL [buffer={3:0}, buffer_size=0, first=0, m={4:0}, next=0, receive=0, send=0] [L758] CALL 0 initLog(10) [L690] 0 buffer_size = max VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] EXPR 0 next = 0 VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L691] 0 first = next = 0 VAL [\old(max)=10, buffer={3:0}, buffer_size=10, first=0, m={4:0}, max=10, next=0, receive=0, send=0] [L758] RET 0 initLog(10) [L759] 0 send=1 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L760] 0 receive=0 VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L761] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, m={4:0}, next=0, receive=0, send=1] [L723] 1 int i; VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L724] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L762] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [buffer={3:0}, buffer_size=10, first=0, id1=-1, id2=0, m={4:0}, next=0, receive=0, send=1] [L739] 2 int i; VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L740] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=0, i=0, m={4:0}, next=0, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L709] 1 buffer[next] = b VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=0, receive=0, send=1] [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=0, b=0, buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size VAL [buffer={3:0}, buffer_size=10, first=0, m={4:0}, next=1, receive=1, send=0] [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] EXPR 2 buffer[first-1] VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L698] 2 return buffer[first-1]; VAL [\result=0, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=1, send=0] [L745] RET, EXPR 2 removeLogElement() [L745] COND TRUE 2 removeLogElement()==i VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=1, send=0] [L747] 2 receive=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=0, send=0] [L748] 2 send=1 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=0, m={4:0}, next=1, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=1, i=1, m={4:0}, next=1, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [\old(b)=1, b=1, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=0, send=1] [L709] 1 buffer[next] = b VAL [\old(b)=1, b=1, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=1, receive=0, send=1] [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=1, b=1, buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=2, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size VAL [buffer={3:0}, buffer_size=10, first=1, m={4:0}, next=2, receive=1, send=0] [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=2, receive=1, send=0] [L698] EXPR 2 buffer[first-1] VAL [buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=2, receive=1, send=0] [L698] 2 return buffer[first-1]; VAL [\result=1, buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=2, receive=1, send=0] [L745] RET, EXPR 2 removeLogElement() [L745] COND TRUE 2 removeLogElement()==i VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=1, m={4:0}, next=2, receive=1, send=0] [L747] 2 receive=0 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=1, m={4:0}, next=2, receive=0, send=0] [L748] 2 send=1 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=1, m={4:0}, next=2, receive=0, send=1] [L740] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=2, m={4:0}, next=2, receive=0, send=1] [L724] COND TRUE 1 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=2, m={4:0}, next=2, receive=0, send=1] [L740] COND TRUE 2 i<7 VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=2, m={4:0}, next=2, receive=0, send=1] [L743] COND FALSE 2 !(\read(receive)) VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=2, i=2, m={4:0}, next=2, receive=0, send=1] [L727] COND TRUE 1 \read(send) [L729] CALL 1 insertLogElement(i) [L707] COND TRUE 1 next < buffer_size && buffer_size > 0 VAL [\old(b)=2, b=2, buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=2, receive=0, send=1] [L709] 1 buffer[next] = b VAL [\old(b)=2, b=2, buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=2, receive=0, send=1] [L710] 1 next = (next+1)%buffer_size VAL [\old(b)=2, b=2, buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=3, receive=0, send=1] [L712] COND TRUE 1 next 0 && first < buffer_size VAL [buffer={3:0}, buffer_size=10, first=2, m={4:0}, next=3, receive=1, send=0] [L697] 2 first++ VAL [buffer={3:0}, buffer_size=10, first=3, m={4:0}, next=3, receive=1, send=0] [L698] EXPR 2 buffer[first-1] VAL [buffer={3:0}, buffer_size=10, first=3, m={4:0}, next=3, receive=1, send=0] [L698] 2 return buffer[first-1]; VAL [\result=2, buffer={3:0}, buffer_size=10, first=3, m={4:0}, next=3, receive=1, send=0] [L745] RET, EXPR 2 removeLogElement() [L745] COND FALSE 2 !(removeLogElement()==i) VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=3, i=3, m={4:0}, next=3, receive=1, send=0] [L746] 2 reach_error() VAL [\old(arg)={0:0}, arg={0:0}, buffer={3:0}, buffer_size=10, first=3, i=3, m={4:0}, next=3, receive=1, send=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 212 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 212 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 212 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.1s, 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: 30, 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.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1214 NumberOfCodeBlocks, 1214 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 2367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 196/196 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: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-16 00:30:12,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...