/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/safe036.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 00:55:58,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 00:55:58,201 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:58,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 00:55:58,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 00:55:58,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 00:55:58,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 00:55:58,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 00:55:58,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 00:55:58,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 00:55:58,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 00:55:58,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 00:55:58,230 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 00:55:58,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 00:55:58,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 00:55:58,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 00:55:58,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 00:55:58,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 00:55:58,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 00:55:58,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 00:55:58,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 00:55:58,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 00:55:58,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 00:55:58,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 00:55:58,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 00:55:58,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 00:55:58,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 00:55:58,234 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 00:55:58,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 00:55:58,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:55:58,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 00:55:58,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 00:55:58,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 00:55:58,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 00:55:58,236 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 00:55:58,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 00:55:58,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 00:55:58,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 00:55:58,237 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 00:55:58,237 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:58,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 00:55:58,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 00:55:58,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 00:55:58,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 00:55:58,551 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 00:55:58,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe036.i [2024-05-07 00:55:59,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 00:55:59,998 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 00:55:59,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe036.i [2024-05-07 00:56:00,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9a5950962/c37003a78f8d4bef8ce2a9dd5f7cadc2/FLAG5268aa2a0 [2024-05-07 00:56:00,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9a5950962/c37003a78f8d4bef8ce2a9dd5f7cadc2 [2024-05-07 00:56:00,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 00:56:00,038 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 00:56:00,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 00:56:00,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 00:56:00,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 00:56:00,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f91b35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00, skipping insertion in model container [2024-05-07 00:56:00,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 00:56:00,225 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/safe036.i[941,954] [2024-05-07 00:56:00,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:56:00,358 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 00:56:00,367 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/safe036.i[941,954] [2024-05-07 00:56:00,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 00:56:00,430 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:56:00,430 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 00:56:00,437 INFO L206 MainTranslator]: Completed translation [2024-05-07 00:56:00,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00 WrapperNode [2024-05-07 00:56:00,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 00:56:00,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 00:56:00,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 00:56:00,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 00:56:00,451 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:56:00" (1/1) ... [2024-05-07 00:56:00,486 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:56:00" (1/1) ... [2024-05-07 00:56:00,509 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2024-05-07 00:56:00,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 00:56:00,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 00:56:00,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 00:56:00,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 00:56:00,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 00:56:00,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 00:56:00,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 00:56:00,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 00:56:00,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (1/1) ... [2024-05-07 00:56:00,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 00:56:00,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:56:00,589 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:56:00,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-07 00:56:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 00:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 00:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 00:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 00:56:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 00:56:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-07 00:56:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-07 00:56:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-07 00:56:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-07 00:56:00,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 00:56:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 00:56:00,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 00:56:00,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 00:56:00,642 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:56:00,808 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 00:56:00,813 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 00:56:00,959 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 00:56:00,968 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 00:56:00,968 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-07 00:56:00,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:56:00 BoogieIcfgContainer [2024-05-07 00:56:00,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 00:56:00,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 00:56:00,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 00:56:00,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 00:56:00,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 12:56:00" (1/3) ... [2024-05-07 00:56:00,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a22731a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:56:00, skipping insertion in model container [2024-05-07 00:56:00,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 12:56:00" (2/3) ... [2024-05-07 00:56:00,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a22731a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 12:56:00, skipping insertion in model container [2024-05-07 00:56:00,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 12:56:00" (3/3) ... [2024-05-07 00:56:00,977 INFO L112 eAbstractionObserver]: Analyzing ICFG safe036.i [2024-05-07 00:56:00,984 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 00:56:00,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 00:56:00,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 00:56:00,993 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 00:56:01,032 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-07 00:56:01,068 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 00:56:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 00:56:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 00:56:01,070 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:56:01,071 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:56:01,100 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 00:56:01,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:56:01,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 00:56:01,117 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;@1bc545cf, 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:56:01,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-05-07 00:56:01,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 00:56:01,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:56:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1335423869, now seen corresponding path program 1 times [2024-05-07 00:56:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:56:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300792027] [2024-05-07 00:56:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:56:01,405 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:56:01,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:56:01,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300792027] [2024-05-07 00:56:01,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300792027] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:56:01,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:56:01,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 00:56:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569970355] [2024-05-07 00:56:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:56:01,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 00:56:01,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:56:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 00:56:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 00:56:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:01,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:56:01,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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:56:01,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:01,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 00:56:01,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 00:56:01,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:56:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 8112446, now seen corresponding path program 1 times [2024-05-07 00:56:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:56:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465938825] [2024-05-07 00:56:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:56:01,916 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:56:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:56:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465938825] [2024-05-07 00:56:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465938825] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:56:01,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:56:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:56:01,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825565544] [2024-05-07 00:56:01,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:56:01,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:56:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:56:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:56:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:56:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:01,920 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:56:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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:56:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 257654855, now seen corresponding path program 1 times [2024-05-07 00:56:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:02,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:56:02,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-07 00:56:02,338 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 00:56:02,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:56:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 783775681, now seen corresponding path program 1 times [2024-05-07 00:56:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:56:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680555437] [2024-05-07 00:56:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:56:02,640 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:56:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:56:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680555437] [2024-05-07 00:56:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680555437] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:56:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:56:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:56:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587215285] [2024-05-07 00:56:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:56:02,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:56:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:56:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:56:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:56:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:02,645 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:56:02,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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:56:02,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:02,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-07 00:56:02,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 257654855, now seen corresponding path program 2 times [2024-05-07 00:56:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:02,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1857126542, now seen corresponding path program 1 times [2024-05-07 00:56:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1314936280, now seen corresponding path program 1 times [2024-05-07 00:56:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -191793658, now seen corresponding path program 1 times [2024-05-07 00:56:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,826 INFO L85 PathProgramCache]: Analyzing trace with hash -698923546, now seen corresponding path program 1 times [2024-05-07 00:56:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash -22545855, now seen corresponding path program 1 times [2024-05-07 00:56:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:03,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:03,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1938935395, now seen corresponding path program 1 times [2024-05-07 00:56:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash -907285010, now seen corresponding path program 1 times [2024-05-07 00:56:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1633300786, now seen corresponding path program 1 times [2024-05-07 00:56:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1161065801, now seen corresponding path program 1 times [2024-05-07 00:56:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 730190416, now seen corresponding path program 1 times [2024-05-07 00:56:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2138542214, now seen corresponding path program 1 times [2024-05-07 00:56:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash 623186120, now seen corresponding path program 1 times [2024-05-07 00:56:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1267097025, now seen corresponding path program 1 times [2024-05-07 00:56:04,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash 733645381, now seen corresponding path program 1 times [2024-05-07 00:56:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1915980306, now seen corresponding path program 1 times [2024-05-07 00:56:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1600823700, now seen corresponding path program 1 times [2024-05-07 00:56:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:04,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 203575047, now seen corresponding path program 3 times [2024-05-07 00:56:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:56:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:56:05,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-07 00:56:05,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 00:56:05,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 00:56:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash -618573567, now seen corresponding path program 2 times [2024-05-07 00:56:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 00:56:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378108003] [2024-05-07 00:56:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 00:56:05,260 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:56:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 00:56:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378108003] [2024-05-07 00:56:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378108003] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 00:56:05,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 00:56:05,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 00:56:05,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307200412] [2024-05-07 00:56:05,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 00:56:05,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 00:56:05,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 00:56:05,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 00:56:05,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-07 00:56:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:05,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 00:56:05,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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:56:05,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:05,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:56:05,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:56:05,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 257654855, now seen corresponding path program 4 times [2024-05-07 00:56:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash -191793658, now seen corresponding path program 2 times [2024-05-07 00:56:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash -698923546, now seen corresponding path program 2 times [2024-05-07 00:56:05,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2138542214, now seen corresponding path program 2 times [2024-05-07 00:56:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash 623186120, now seen corresponding path program 2 times [2024-05-07 00:56:05,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:05,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1267097025, now seen corresponding path program 2 times [2024-05-07 00:56:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:06,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash 733645381, now seen corresponding path program 2 times [2024-05-07 00:56:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 00:56:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 00:56:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:06,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 00:56:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 00:56:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 00:56:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-07 00:56:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:56:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 00:56:06,295 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-05-07 00:56:06,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-05-07 00:56:06,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-05-07 00:56:06,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-07 00:56:06,300 INFO L448 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-07 00:56:06,302 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-07 00:56:06,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-07 00:56:06,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 12:56:06 BasicIcfg [2024-05-07 00:56:06,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-07 00:56:06,306 INFO L158 Benchmark]: Toolchain (without parser) took 6268.17ms. Allocated memory was 292.6MB in the beginning and 364.9MB in the end (delta: 72.4MB). Free memory was 219.4MB in the beginning and 124.1MB in the end (delta: 95.3MB). Peak memory consumption was 168.0MB. Max. memory is 8.0GB. [2024-05-07 00:56:06,306 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 292.6MB. Free memory is still 258.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-07 00:56:06,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.29ms. Allocated memory is still 292.6MB. Free memory was 219.2MB in the beginning and 198.9MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-07 00:56:06,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.14ms. Allocated memory is still 292.6MB. Free memory was 198.9MB in the beginning and 196.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-07 00:56:06,307 INFO L158 Benchmark]: Boogie Preprocessor took 39.60ms. Allocated memory is still 292.6MB. Free memory was 196.8MB in the beginning and 260.3MB in the end (delta: -63.5MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2024-05-07 00:56:06,307 INFO L158 Benchmark]: RCFGBuilder took 419.25ms. Allocated memory is still 292.6MB. Free memory was 260.3MB in the beginning and 247.0MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-07 00:56:06,308 INFO L158 Benchmark]: TraceAbstraction took 5333.46ms. Allocated memory was 292.6MB in the beginning and 364.9MB in the end (delta: 72.4MB). Free memory was 246.0MB in the beginning and 124.1MB in the end (delta: 121.9MB). Peak memory consumption was 193.7MB. Max. memory is 8.0GB. [2024-05-07 00:56:06,309 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.14ms. Allocated memory is still 292.6MB. Free memory is still 258.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 399.29ms. Allocated memory is still 292.6MB. Free memory was 219.2MB in the beginning and 198.9MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.14ms. Allocated memory is still 292.6MB. Free memory was 198.9MB in the beginning and 196.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.60ms. Allocated memory is still 292.6MB. Free memory was 196.8MB in the beginning and 260.3MB in the end (delta: -63.5MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * RCFGBuilder took 419.25ms. Allocated memory is still 292.6MB. Free memory was 260.3MB in the beginning and 247.0MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5333.46ms. Allocated memory was 292.6MB in the beginning and 364.9MB in the end (delta: 72.4MB). Free memory was 246.0MB in the beginning and 124.1MB in the end (delta: 121.9MB). Peak memory consumption was 193.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7981, independent: 7841, independent conditional: 7730, independent unconditional: 111, dependent: 140, dependent conditional: 140, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7943, independent: 7841, independent conditional: 7730, independent unconditional: 111, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7943, independent: 7841, independent conditional: 7730, independent unconditional: 111, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7943, independent: 7841, independent conditional: 7730, independent unconditional: 111, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8176, independent: 7841, independent conditional: 3527, independent unconditional: 4314, dependent: 335, dependent conditional: 233, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8176, independent: 7841, independent conditional: 1727, independent unconditional: 6114, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8176, independent: 7841, independent conditional: 1727, independent unconditional: 6114, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 497, independent: 489, independent conditional: 102, independent unconditional: 387, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 497, independent: 483, independent conditional: 0, independent unconditional: 483, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8176, independent: 7352, independent conditional: 1625, independent unconditional: 5727, dependent: 327, dependent conditional: 70, dependent unconditional: 257, unknown: 497, unknown conditional: 105, unknown unconditional: 392] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 489, Positive conditional cache size: 102, Positive unconditional cache size: 387, Negative cache size: 8, Negative conditional cache size: 3, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1960, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8176, independent: 7841, independent conditional: 3527, independent unconditional: 4314, dependent: 335, dependent conditional: 233, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8176, independent: 7841, independent conditional: 1727, independent unconditional: 6114, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8176, independent: 7841, independent conditional: 1727, independent unconditional: 6114, dependent: 335, dependent conditional: 73, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 497, independent: 489, independent conditional: 102, independent unconditional: 387, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 497, independent: 483, independent conditional: 0, independent unconditional: 483, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 8, dependent conditional: 3, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 44, dependent conditional: 35, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8176, independent: 7352, independent conditional: 1625, independent unconditional: 5727, dependent: 327, dependent conditional: 70, dependent unconditional: 257, unknown: 497, unknown conditional: 105, unknown unconditional: 392] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 489, Positive conditional cache size: 102, Positive unconditional cache size: 387, Negative cache size: 8, Negative conditional cache size: 3, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1960 ], Independence queries for same thread: 38 - 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 5 procedures, 95 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 3.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 29, 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.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 3.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 36, ConditionalCommutativityTraceChecks: 26, 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:56:06,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-07 00:56:06,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...