/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 DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/lamport.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-04 06:21:11,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 06:21:11,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 06:21:11,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 06:21:11,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 06:21:11,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 06:21:11,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 06:21:11,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 06:21:11,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 06:21:11,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 06:21:11,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 06:21:11,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 06:21:11,903 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 06:21:11,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 06:21:11,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 06:21:11,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 06:21:11,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 06:21:11,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 06:21:11,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 06:21:11,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 06:21:11,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 06:21:11,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 06:21:11,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 06:21:11,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 06:21:11,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 06:21:11,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 06:21:11,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 06:21:11,907 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 06:21:11,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 06:21:11,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 06:21:11,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 06:21:11,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 06:21:11,909 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 06:21:11,910 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 -> DEFAULT 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-04 06:21:12,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 06:21:12,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 06:21:12,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 06:21:12,156 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-05-04 06:21:12,157 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-05-04 06:21:12,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/lamport.wvr.bpl [2024-05-04 06:21:12,158 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/lamport.wvr.bpl' [2024-05-04 06:21:12,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 06:21:12,221 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-05-04 06:21:12,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 06:21:12,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 06:21:12,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 06:21:12,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,313 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-05-04 06:21:12,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 06:21:12,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 06:21:12,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 06:21:12,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 06:21:12,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 06:21:12,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 06:21:12,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 06:21:12,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 06:21:12,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/1) ... [2024-05-04 06:21:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 06:21:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 06:21:12,393 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-04 06:21:12,443 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-04 06:21:12,464 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-05-04 06:21:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-04 06:21:12,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-04 06:21:12,465 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-05-04 06:21:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-04 06:21:12,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-04 06:21:12,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-05-04 06:21:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 06:21:12,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 06:21:12,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-05-04 06:21:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-04 06:21:12,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-04 06:21:12,467 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 06:21:12,512 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 06:21:12,514 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 06:21:12,596 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 06:21:12,605 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 06:21:12,605 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-04 06:21:12,606 INFO L201 PluginConnector]: Adding new model lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:21:12 BoogieIcfgContainer [2024-05-04 06:21:12,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 06:21:12,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 06:21:12,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 06:21:12,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 06:21:12,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 06:21:12" (1/2) ... [2024-05-04 06:21:12,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130c8396 and model type lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:21:12, skipping insertion in model container [2024-05-04 06:21:12,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:21:12" (2/2) ... [2024-05-04 06:21:12,621 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.wvr.bpl [2024-05-04 06:21:12,626 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 06:21:12,634 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 06:21:12,634 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 06:21:12,635 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 06:21:12,681 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-04 06:21:12,712 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 06:21:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 06:21:12,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 06:21:12,715 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-04 06:21:12,717 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-04 06:21:12,747 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 06:21:12,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 06:21:12,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 06:21:12,764 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;@606984f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-04 06:21:12,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-04 06:21:12,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 06:21:12,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 06:21:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1853717560, now seen corresponding path program 1 times [2024-05-04 06:21:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 06:21:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734975593] [2024-05-04 06:21:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:13,175 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-04 06:21:13,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 06:21:13,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734975593] [2024-05-04 06:21:13,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734975593] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 06:21:13,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 06:21:13,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-04 06:21:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613794704] [2024-05-04 06:21:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 06:21:13,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-04 06:21:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 06:21:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 06:21:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-04 06:21:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 06:21:13,209 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 06:21:13,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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-04 06:21:13,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 06:21:13,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-05-04 06:21:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1172770809, now seen corresponding path program 1 times [2024-05-04 06:21:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:13,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:13,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-05-04 06:21:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 615282249, now seen corresponding path program 1 times [2024-05-04 06:21:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:13,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:13,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-05-04 06:21:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -159129107, now seen corresponding path program 1 times [2024-05-04 06:21:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:15,927 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-04 06:21:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:15,964 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-04 06:21:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-04 06:21:15,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-04 06:21:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash 584714884, now seen corresponding path program 1 times [2024-05-04 06:21:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:16,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:16,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1171135620, now seen corresponding path program 1 times [2024-05-04 06:21:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:16,415 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-04 06:21:16,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:16,422 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-04 06:21:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 06:21:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-05-04 06:21:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash 584714884, now seen corresponding path program 2 times [2024-05-04 06:21:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:16,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:16,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-05-04 06:21:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1692473245, now seen corresponding path program 2 times [2024-05-04 06:21:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:16,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:16,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:16,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-05-04 06:21:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1692473027, now seen corresponding path program 2 times [2024-05-04 06:21:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:19,041 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-04 06:21:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:19,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:19,092 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-04 06:21:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-04 06:21:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-05-04 06:21:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash 584714884, now seen corresponding path program 3 times [2024-05-04 06:21:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:19,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 06:21:19,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9 [2024-05-04 06:21:19,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-04 06:21:19,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 06:21:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -241436610, now seen corresponding path program 2 times [2024-05-04 06:21:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 06:21:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73011675] [2024-05-04 06:21:19,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:19,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:19,577 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-04 06:21:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 06:21:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73011675] [2024-05-04 06:21:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73011675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 06:21:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 06:21:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-04 06:21:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052189537] [2024-05-04 06:21:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 06:21:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-04 06:21:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 06:21:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 06:21:19,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-04 06:21:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 06:21:19,580 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 06:21:19,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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-04 06:21:19,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 06:21:19,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 06:21:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 584714884, now seen corresponding path program 4 times [2024-05-04 06:21:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:19,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1171125690, now seen corresponding path program 1 times [2024-05-04 06:21:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:20,075 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-04 06:21:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:20,082 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-04 06:21:20,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 06:21:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2024-05-04 06:21:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash 584714884, now seen corresponding path program 5 times [2024-05-04 06:21:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:20,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 584738414, now seen corresponding path program 1 times [2024-05-04 06:21:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:20,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:20,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-05-04 06:21:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 465610691, now seen corresponding path program 3 times [2024-05-04 06:21:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:20,690 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-04 06:21:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 06:21:20,712 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-04 06:21:20,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 06:21:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2024-05-04 06:21:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 584714884, now seen corresponding path program 6 times [2024-05-04 06:21:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:21,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 584738414, now seen corresponding path program 2 times [2024-05-04 06:21:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 06:21:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 06:21:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:21,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 06:21:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 06:21:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 06:21:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 06:21:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2024-05-04 06:21:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-04 06:21:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-04 06:21:21,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-04 06:21:21,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-04 06:21:21,344 INFO L448 BasicCegarLoop]: Path program histogram: [6, 3, 2, 2, 2, 1, 1, 1] [2024-05-04 06:21:21,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 06:21:21,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 06:21:21,349 INFO L201 PluginConnector]: Adding new model lamport.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 06:21:21 BasicIcfg [2024-05-04 06:21:21,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 06:21:21,350 INFO L158 Benchmark]: Toolchain (without parser) took 9128.69ms. Allocated memory was 168.8MB in the beginning and 252.7MB in the end (delta: 83.9MB). Free memory was 138.0MB in the beginning and 109.2MB in the end (delta: 28.8MB). Peak memory consumption was 112.1MB. Max. memory is 8.0GB. [2024-05-04 06:21:21,351 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 06:21:21,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.56ms. Allocated memory was 168.8MB in the beginning and 252.7MB in the end (delta: 83.9MB). Free memory was 137.9MB in the beginning and 229.4MB in the end (delta: -91.5MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2024-05-04 06:21:21,354 INFO L158 Benchmark]: Boogie Preprocessor took 28.58ms. Allocated memory is still 252.7MB. Free memory was 229.4MB in the beginning and 228.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 06:21:21,354 INFO L158 Benchmark]: RCFGBuilder took 261.02ms. Allocated memory is still 252.7MB. Free memory was 228.4MB in the beginning and 217.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-04 06:21:21,355 INFO L158 Benchmark]: TraceAbstraction took 8740.85ms. Allocated memory is still 252.7MB. Free memory was 216.8MB in the beginning and 109.2MB in the end (delta: 107.7MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. [2024-05-04 06:21:21,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 168.8MB. Free memory is still 99.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 90.56ms. Allocated memory was 168.8MB in the beginning and 252.7MB in the end (delta: 83.9MB). Free memory was 137.9MB in the beginning and 229.4MB in the end (delta: -91.5MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.58ms. Allocated memory is still 252.7MB. Free memory was 229.4MB in the beginning and 228.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 261.02ms. Allocated memory is still 252.7MB. Free memory was 228.4MB in the beginning and 217.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8740.85ms. Allocated memory is still 252.7MB. Free memory was 216.8MB in the beginning and 109.2MB in the end (delta: 107.7MB). Peak memory consumption was 108.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: 13095, independent: 13017, independent conditional: 12939, independent unconditional: 78, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13095, independent: 13017, independent conditional: 12939, independent unconditional: 78, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13095, independent: 13017, independent conditional: 12939, independent unconditional: 78, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13095, independent: 13017, independent conditional: 12939, independent unconditional: 78, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13336, independent: 13017, independent conditional: 6255, independent unconditional: 6762, dependent: 319, dependent conditional: 236, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13336, independent: 13017, independent conditional: 3671, independent unconditional: 9346, dependent: 319, dependent conditional: 113, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13336, independent: 13017, independent conditional: 3671, independent unconditional: 9346, dependent: 319, dependent conditional: 113, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 373, independent: 337, independent conditional: 102, independent unconditional: 235, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 373, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 6, independent conditional: 2, independent unconditional: 3, dependent: 73, dependent conditional: 42, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13336, independent: 12680, independent conditional: 3569, independent unconditional: 9111, dependent: 283, dependent conditional: 89, dependent unconditional: 194, unknown: 373, unknown conditional: 126, unknown unconditional: 247] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 337, Positive conditional cache size: 102, Positive unconditional cache size: 235, Negative cache size: 36, Negative conditional cache size: 24, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2707, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13336, independent: 13017, independent conditional: 6255, independent unconditional: 6762, dependent: 319, dependent conditional: 236, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13336, independent: 13017, independent conditional: 3671, independent unconditional: 9346, dependent: 319, dependent conditional: 113, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13336, independent: 13017, independent conditional: 3671, independent unconditional: 9346, dependent: 319, dependent conditional: 113, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 373, independent: 337, independent conditional: 102, independent unconditional: 235, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 373, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 36, dependent conditional: 24, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 6, independent conditional: 2, independent unconditional: 3, dependent: 73, dependent conditional: 42, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13336, independent: 12680, independent conditional: 3569, independent unconditional: 9111, dependent: 283, dependent conditional: 89, dependent unconditional: 194, unknown: 373, unknown conditional: 126, unknown unconditional: 247] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 337, Positive conditional cache size: 102, Positive unconditional cache size: 235, Negative cache size: 36, Negative conditional cache size: 24, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2707 ], Independence queries for same thread: 0 - PositiveResult [Line: 71]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 71 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 8.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 16, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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: 7.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 5, ConditionalCommutativityConditionCalculations: 37, ConditionalCommutativityTraceChecks: 16, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-04 06:21:21,379 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-04 06:21:21,580 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...