/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:55:04,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:55:04,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 00:55:04,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:55:04,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:55:04,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:55:04,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:55:04,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:55:04,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:55:04,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:55:04,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:55:04,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:55:04,231 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:55:04,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:55:04,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:55:04,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:55:04,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:55:04,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:55:04,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:55:04,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:55:04,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:55:04,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:55:04,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:55:04,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:55:04,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:55:04,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:55:04,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:55:04,234 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:55:04,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:55:04,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:55:04,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:55:04,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:55:04,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:55:04,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 00:55:04,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:55:04,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:55:04,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:55:04,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:55:04,542 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:55:04,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2024-05-07 00:55:05,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:55:05,742 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:55:05,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_tso.i [2024-05-07 00:55:05,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/41d65d590/9c0b79de2d32403abd39c2fab83265cb/FLAG2ff70849e [2024-05-07 00:55:05,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/41d65d590/9c0b79de2d32403abd39c2fab83265cb [2024-05-07 00:55:05,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:55:05,773 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:55:05,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:55:05,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:55:05,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:55:05,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:55:05" (1/1) ... [2024-05-07 00:55:05,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a68b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:05, skipping insertion in model container [2024-05-07 00:55:05,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:55:05" (1/1) ... [2024-05-07 00:55:05,838 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:55:05,945 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_tso.i[945,958] [2024-05-07 00:55:06,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:55:06,107 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:55:06,117 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_tso.i[945,958] [2024-05-07 00:55:06,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:55:06,176 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:55:06,176 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:55:06,182 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:55:06,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06 WrapperNode [2024-05-07 00:55:06,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:55:06,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:55:06,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:55:06,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:55:06,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,230 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-05-07 00:55:06,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:55:06,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:55:06,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:55:06,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:55:06,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:55:06,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:55:06,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:55:06,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:55:06,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (1/1) ... [2024-05-07 00:55:06,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:55:06,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:55:06,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 00:55:06,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 00:55:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:55:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:55:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:55:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:55:06,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:55:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:55:06,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:55:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:55:06,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:55:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-07 00:55:06,361 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-07 00:55:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:55:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:55:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:55:06,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:55:06,362 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 00:55:06,506 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:55:06,507 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:55:06,729 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:55:06,739 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:55:06,739 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:55:06,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:55:06 BoogieIcfgContainer [2024-05-07 00:55:06,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:55:06,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:55:06,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:55:06,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:55:06,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:55:05" (1/3) ... [2024-05-07 00:55:06,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2476334d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:55:06, skipping insertion in model container [2024-05-07 00:55:06,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:55:06" (2/3) ... [2024-05-07 00:55:06,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2476334d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:55:06, skipping insertion in model container [2024-05-07 00:55:06,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:55:06" (3/3) ... [2024-05-07 00:55:06,753 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_tso.i [2024-05-07 00:55:06,759 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:55:06,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:55:06,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:55:06,766 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:55:06,814 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:55:06,847 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:55:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:55:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:55:06,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 00:55:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 00:55:06,920 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:55:06,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:55:06,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:55:06,960 INFO L357 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, mHoare=true, 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;@4c78bd5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 00:55:06,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 00:55:07,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:55:07,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:55:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 540088311, now seen corresponding path program 1 times [2024-05-07 00:55:07,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:55:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486047310] [2024-05-07 00:55:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:55:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:55:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:55:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486047310] [2024-05-07 00:55:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486047310] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:55:07,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:55:07,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:55:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129016087] [2024-05-07 00:55:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:55:07,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:55:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:55:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:55:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:55:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:07,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:55:07,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-05-07 00:55:07,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:07,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:55:07,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:55:07,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:55:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2017357271, now seen corresponding path program 1 times [2024-05-07 00:55:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:55:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117284358] [2024-05-07 00:55:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:55:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:55:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:55:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117284358] [2024-05-07 00:55:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117284358] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:55:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:55:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 00:55:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389461975] [2024-05-07 00:55:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:55:07,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 00:55:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:55:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 00:55:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-07 00:55:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:07,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:55:07,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-05-07 00:55:07,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:07,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash -262007563, now seen corresponding path program 1 times [2024-05-07 00:55:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:55:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:55:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:55:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:55:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-07 00:55:08,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-07 00:55:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash -152832788, now seen corresponding path program 1 times [2024-05-07 00:55:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:08,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:08,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:55:08,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 00:55:08,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 00:55:08,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:55:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -529347476, now seen corresponding path program 1 times [2024-05-07 00:55:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:55:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000279757] [2024-05-07 00:55:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:55:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 00:55:08,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:55:08,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000279757] [2024-05-07 00:55:08,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000279757] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:55:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:55:08,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:55:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501487752] [2024-05-07 00:55:08,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:55:08,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:55:08,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:55:08,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:55:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:55:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:08,995 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:55:08,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-07 00:55:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:55:08,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -152832788, now seen corresponding path program 2 times [2024-05-07 00:55:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1727412032, now seen corresponding path program 1 times [2024-05-07 00:55:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -233925203, now seen corresponding path program 1 times [2024-05-07 00:55:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -99693296, now seen corresponding path program 3 times [2024-05-07 00:55:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:09,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash -973066432, now seen corresponding path program 2 times [2024-05-07 00:55:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2109617455, now seen corresponding path program 2 times [2024-05-07 00:55:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1513694246, now seen corresponding path program 1 times [2024-05-07 00:55:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash 921014036, now seen corresponding path program 1 times [2024-05-07 00:55:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2048413336, now seen corresponding path program 1 times [2024-05-07 00:55:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1873669394, now seen corresponding path program 1 times [2024-05-07 00:55:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2017767086, now seen corresponding path program 1 times [2024-05-07 00:55:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1034860978, now seen corresponding path program 1 times [2024-05-07 00:55:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1695903483, now seen corresponding path program 1 times [2024-05-07 00:55:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash -885957857, now seen corresponding path program 1 times [2024-05-07 00:55:10,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1527815179, now seen corresponding path program 1 times [2024-05-07 00:55:10,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:10,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash 742032579, now seen corresponding path program 1 times [2024-05-07 00:55:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:11,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 204710449, now seen corresponding path program 1 times [2024-05-07 00:55:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1031344410, now seen corresponding path program 1 times [2024-05-07 00:55:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 864911646, now seen corresponding path program 1 times [2024-05-07 00:55:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash -385059444, now seen corresponding path program 1 times [2024-05-07 00:55:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1791316640, now seen corresponding path program 1 times [2024-05-07 00:55:12,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1720412962, now seen corresponding path program 1 times [2024-05-07 00:55:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1051033436, now seen corresponding path program 1 times [2024-05-07 00:55:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1768671759, now seen corresponding path program 1 times [2024-05-07 00:55:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1465952845, now seen corresponding path program 1 times [2024-05-07 00:55:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:12,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:12,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -673205508, now seen corresponding path program 2 times [2024-05-07 00:55:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:55:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:55:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:13,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:55:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:55:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:55:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-07 00:55:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:55:14,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-07 00:55:14,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-07 00:55:14,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-07 00:55:14,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-07 00:55:14,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:55:14,200 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 00:55:14,202 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:55:14,202 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:55:14,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:55:14 BasicIcfg [2024-05-07 00:55:14,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:55:14,206 INFO L158 Benchmark]: Toolchain (without parser) took 8432.87ms. Allocated memory was 163.6MB in the beginning and 520.1MB in the end (delta: 356.5MB). Free memory was 89.6MB in the beginning and 338.7MB in the end (delta: -249.1MB). Peak memory consumption was 108.0MB. Max. memory is 8.0GB. [2024-05-07 00:55:14,206 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 163.6MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:55:14,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.85ms. Allocated memory was 163.6MB in the beginning and 299.9MB in the end (delta: 136.3MB). Free memory was 89.5MB in the beginning and 253.0MB in the end (delta: -163.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2024-05-07 00:55:14,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 299.9MB. Free memory was 253.0MB in the beginning and 250.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:55:14,211 INFO L158 Benchmark]: Boogie Preprocessor took 32.40ms. Allocated memory is still 299.9MB. Free memory was 250.9MB in the beginning and 249.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:55:14,211 INFO L158 Benchmark]: RCFGBuilder took 476.62ms. Allocated memory is still 299.9MB. Free memory was 249.4MB in the beginning and 260.5MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-05-07 00:55:14,211 INFO L158 Benchmark]: TraceAbstraction took 7460.31ms. Allocated memory was 299.9MB in the beginning and 520.1MB in the end (delta: 220.2MB). Free memory was 259.4MB in the beginning and 338.7MB in the end (delta: -79.3MB). Peak memory consumption was 141.9MB. Max. memory is 8.0GB. [2024-05-07 00:55:14,212 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.12ms. Allocated memory is still 163.6MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.85ms. Allocated memory was 163.6MB in the beginning and 299.9MB in the end (delta: 136.3MB). Free memory was 89.5MB in the beginning and 253.0MB in the end (delta: -163.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.20ms. Allocated memory is still 299.9MB. Free memory was 253.0MB in the beginning and 250.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.40ms. Allocated memory is still 299.9MB. Free memory was 250.9MB in the beginning and 249.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 476.62ms. Allocated memory is still 299.9MB. Free memory was 249.4MB in the beginning and 260.5MB in the end (delta: -11.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7460.31ms. Allocated memory was 299.9MB in the beginning and 520.1MB in the end (delta: 220.2MB). Free memory was 259.4MB in the beginning and 338.7MB in the end (delta: -79.3MB). Peak memory consumption was 141.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 90663, independent: 89281, independent conditional: 89067, independent unconditional: 214, dependent: 1382, dependent conditional: 1382, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 90363, independent: 89281, independent conditional: 89067, independent unconditional: 214, dependent: 1082, dependent conditional: 1082, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90363, independent: 89281, independent conditional: 89067, independent unconditional: 214, dependent: 1082, dependent conditional: 1082, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90363, independent: 89281, independent conditional: 89067, independent unconditional: 214, dependent: 1082, dependent conditional: 1082, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92733, independent: 89281, independent conditional: 42250, independent unconditional: 47031, dependent: 3452, dependent conditional: 2363, dependent unconditional: 1089, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92733, independent: 89281, independent conditional: 19477, independent unconditional: 69804, dependent: 3452, dependent conditional: 918, dependent unconditional: 2534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92733, independent: 89281, independent conditional: 19477, independent unconditional: 69804, dependent: 3452, dependent conditional: 918, dependent unconditional: 2534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1121, independent: 1100, independent conditional: 220, independent unconditional: 880, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1121, independent: 1081, independent conditional: 0, independent unconditional: 1081, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 50, dependent conditional: 40, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 92733, independent: 88181, independent conditional: 19257, independent unconditional: 68924, dependent: 3431, dependent conditional: 908, dependent unconditional: 2523, unknown: 1121, unknown conditional: 230, unknown unconditional: 891] , Statistics on independence cache: Total cache size (in pairs): 1121, Positive cache size: 1100, Positive conditional cache size: 220, Positive unconditional cache size: 880, Negative cache size: 21, Negative conditional cache size: 10, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24218, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92733, independent: 89281, independent conditional: 42250, independent unconditional: 47031, dependent: 3452, dependent conditional: 2363, dependent unconditional: 1089, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92733, independent: 89281, independent conditional: 19477, independent unconditional: 69804, dependent: 3452, dependent conditional: 918, dependent unconditional: 2534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92733, independent: 89281, independent conditional: 19477, independent unconditional: 69804, dependent: 3452, dependent conditional: 918, dependent unconditional: 2534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1121, independent: 1100, independent conditional: 220, independent unconditional: 880, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1121, independent: 1081, independent conditional: 0, independent unconditional: 1081, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 40, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 21, dependent conditional: 10, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 50, dependent conditional: 40, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 92733, independent: 88181, independent conditional: 19257, independent unconditional: 68924, dependent: 3431, dependent conditional: 908, dependent unconditional: 2523, unknown: 1121, unknown conditional: 230, unknown unconditional: 891] , Statistics on independence cache: Total cache size (in pairs): 1121, Positive cache size: 1100, Positive conditional cache size: 220, Positive unconditional cache size: 880, Negative cache size: 21, Negative conditional cache size: 10, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24218 ], Independence queries for same thread: 300 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 121 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 6.2s, 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: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 491 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 4.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 80, ConditionalCommutativityTraceChecks: 28, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-07 00:55:14,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-07 00:55:14,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...