/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 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-faa7b7a-m [2024-04-27 12:39:43,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-27 12:39:43,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-27 12:39:43,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-27 12:39:43,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-27 12:39:43,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-27 12:39:43,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-27 12:39:43,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-27 12:39:43,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-27 12:39:43,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-27 12:39:43,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-27 12:39:43,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-27 12:39:43,424 INFO L153 SettingsManager]: * Use SBE=true [2024-04-27 12:39:43,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-27 12:39:43,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-27 12:39:43,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-27 12:39:43,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-27 12:39:43,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-27 12:39:43,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-27 12:39:43,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-27 12:39:43,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-27 12:39:43,427 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-27 12:39:43,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-27 12:39:43,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-27 12:39:43,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-27 12:39:43,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-27 12:39:43,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-27 12:39:43,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-27 12:39:43,429 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-27 12:39:43,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-27 12:39:43,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-27 12:39:43,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-27 12:39:43,430 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-27 12:39:43,430 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 -> 50 [2024-04-27 12:39:43,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-27 12:39:43,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-27 12:39:43,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-27 12:39:43,687 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-27 12:39:43,689 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-27 12:39:43,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl [2024-04-27 12:39:43,690 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl' [2024-04-27 12:39:43,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-27 12:39:43,726 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-27 12:39:43,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-27 12:39:43,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-27 12:39:43,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-27 12:39:43,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,784 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-27 12:39:43,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-27 12:39:43,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-27 12:39:43,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-27 12:39:43,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-27 12:39:43,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-27 12:39:43,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-27 12:39:43,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-27 12:39:43,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-27 12:39:43,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/1) ... [2024-04-27 12:39:43,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-27 12:39:43,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:39:43,841 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-04-27 12:39:43,849 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-04-27 12:39:43,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-27 12:39:43,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-27 12:39:43,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-27 12:39:43,878 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-27 12:39:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-27 12:39:43,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-27 12:39:43,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-27 12:39:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-27 12:39:43,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-27 12:39:43,879 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-27 12:39:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-27 12:39:43,879 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-27 12:39:43,880 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-27 12:39:43,917 INFO L241 CfgBuilder]: Building ICFG [2024-04-27 12:39:43,919 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-27 12:39:44,022 INFO L282 CfgBuilder]: Performing block encoding [2024-04-27 12:39:44,035 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-27 12:39:44,035 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-27 12:39:44,036 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:39:44 BoogieIcfgContainer [2024-04-27 12:39:44,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-27 12:39:44,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-27 12:39:44,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-27 12:39:44,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-27 12:39:44,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 12:39:43" (1/2) ... [2024-04-27 12:39:44,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46986d4e and model type prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:39:44, skipping insertion in model container [2024-04-27 12:39:44,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:39:44" (2/2) ... [2024-04-27 12:39:44,043 INFO L112 eAbstractionObserver]: Analyzing ICFG prod-cons.wvr.bpl [2024-04-27 12:39:44,048 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-27 12:39:44,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-27 12:39:44,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-27 12:39:44,055 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-27 12:39:44,092 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-27 12:39:44,123 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-27 12:39:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-27 12:39:44,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:39:44,132 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-04-27 12:39:44,132 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-04-27 12:39:44,170 INFO L187 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-27 12:39:44,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:39:44,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-27 12:39:44,196 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;@6e8ef300, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-04-27 12:39:44,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-27 12:39:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -738655976, now seen corresponding path program 1 times [2024-04-27 12:39:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-27 12:39:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-27 12:39:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash -738655976, now seen corresponding path program 2 times [2024-04-27 12:39:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:44,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 12:39:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-27 12:39:44,973 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-04-27 12:39:44,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:39:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash -385570830, now seen corresponding path program 1 times [2024-04-27 12:39:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:39:44,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843849454] [2024-04-27 12:39:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:39:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843849454] [2024-04-27 12:39:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843849454] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 12:39:45,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-27 12:39:45,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-27 12:39:45,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7574804] [2024-04-27 12:39:45,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 12:39:45,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-27 12:39:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:39:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-27 12:39:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-27 12:39:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:39:45,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:39:45,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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-04-27 12:39:45,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:39:45,382 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-04-27 12:39:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1298490335, now seen corresponding path program 1 times [2024-04-27 12:39:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,564 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-04-27 12:39:45,571 INFO L85 PathProgramCache]: Analyzing trace with hash -691482717, now seen corresponding path program 2 times [2024-04-27 12:39:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,718 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-04-27 12:39:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1270834982, now seen corresponding path program 1 times [2024-04-27 12:39:45,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:45,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,893 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-04-27 12:39:45,915 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-04-27 12:39:45,935 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-04-27 12:39:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1057385150, now seen corresponding path program 1 times [2024-04-27 12:39:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:45,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:45,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,058 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-04-27 12:39:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 781164454, now seen corresponding path program 1 times [2024-04-27 12:39:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:46,231 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-04-27 12:39:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1235942850, now seen corresponding path program 2 times [2024-04-27 12:39:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,327 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-04-27 12:39:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1769295253, now seen corresponding path program 1 times [2024-04-27 12:39:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,476 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-04-27 12:39:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2112318873, now seen corresponding path program 1 times [2024-04-27 12:39:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1590285636, now seen corresponding path program 1 times [2024-04-27 12:39:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 12:39:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-04-27 12:39:46,817 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-04-27 12:39:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1298490335, now seen corresponding path program 3 times [2024-04-27 12:39:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-27 12:39:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-27 12:39:46,959 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-04-27 12:39:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -691482717, now seen corresponding path program 4 times [2024-04-27 12:39:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:46,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,044 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-04-27 12:39:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1270834982, now seen corresponding path program 2 times [2024-04-27 12:39:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:47,176 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-04-27 12:39:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash 781164454, now seen corresponding path program 3 times [2024-04-27 12:39:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:47,312 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-04-27 12:39:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1235942850, now seen corresponding path program 4 times [2024-04-27 12:39:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,407 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-04-27 12:39:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1769295253, now seen corresponding path program 2 times [2024-04-27 12:39:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1589345778, now seen corresponding path program 1 times [2024-04-27 12:39:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2025078787, now seen corresponding path program 1 times [2024-04-27 12:39:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2025078787, now seen corresponding path program 2 times [2024-04-27 12:39:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:39:47,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17 [2024-04-27 12:39:47,826 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-04-27 12:39:47,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:39:47,827 INFO L85 PathProgramCache]: Analyzing trace with hash 152573933, now seen corresponding path program 1 times [2024-04-27 12:39:47,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:39:47,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145409304] [2024-04-27 12:39:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:39:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145409304] [2024-04-27 12:39:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145409304] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:39:47,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090990921] [2024-04-27 12:39:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:47,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:39:47,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:39:47,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:39:47,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-27 12:39:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:47,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2024-04-27 12:39:47,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:39:48,030 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 11 treesize of output 7 [2024-04-27 12:39:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:48,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:39:48,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:39:48,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-04-27 12:39:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:48,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090990921] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 12:39:48,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 12:39:48,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-04-27 12:39:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6834300] [2024-04-27 12:39:48,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 12:39:48,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-04-27 12:39:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:39:48,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-04-27 12:39:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-04-27 12:39:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:39:48,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:39:48,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-04-27 12:39:48,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:39:48,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:39:48,558 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-04-27 12:39:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -352655140, now seen corresponding path program 5 times [2024-04-27 12:39:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-27 12:39:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-27 12:39:48,696 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-04-27 12:39:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1445147848, now seen corresponding path program 6 times [2024-04-27 12:39:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:48,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:48,825 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-04-27 12:39:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1298490335, now seen corresponding path program 7 times [2024-04-27 12:39:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:48,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:48,962 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-04-27 12:39:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash -691482717, now seen corresponding path program 8 times [2024-04-27 12:39:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:48,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,063 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-04-27 12:39:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1270834982, now seen corresponding path program 3 times [2024-04-27 12:39:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:49,197 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-04-27 12:39:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 159282337, now seen corresponding path program 5 times [2024-04-27 12:39:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,310 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-04-27 12:39:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1537722147, now seen corresponding path program 6 times [2024-04-27 12:39:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,407 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-04-27 12:39:49,424 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-04-27 12:39:49,475 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-04-27 12:39:49,492 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-04-27 12:39:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash 781164454, now seen corresponding path program 7 times [2024-04-27 12:39:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:49,615 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-04-27 12:39:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1235942850, now seen corresponding path program 8 times [2024-04-27 12:39:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:49,752 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-04-27 12:39:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1769295253, now seen corresponding path program 3 times [2024-04-27 12:39:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 12:39:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-04-27 12:39:49,900 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-04-27 12:39:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -352655140, now seen corresponding path program 9 times [2024-04-27 12:39:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-27 12:39:49,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-27 12:39:50,015 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-04-27 12:39:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1445147848, now seen corresponding path program 10 times [2024-04-27 12:39:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,124 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-04-27 12:39:50,138 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-04-27 12:39:50,151 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-04-27 12:39:50,169 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-04-27 12:39:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1298490335, now seen corresponding path program 11 times [2024-04-27 12:39:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-27 12:39:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-27 12:39:50,249 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-04-27 12:39:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash -691482717, now seen corresponding path program 12 times [2024-04-27 12:39:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,452 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-04-27 12:39:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash -691696932, now seen corresponding path program 4 times [2024-04-27 12:39:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:50,586 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-04-27 12:39:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 159282337, now seen corresponding path program 9 times [2024-04-27 12:39:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,682 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-04-27 12:39:50,694 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-04-27 12:39:50,703 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-04-27 12:39:50,717 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-04-27 12:39:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1537722147, now seen corresponding path program 10 times [2024-04-27 12:39:50,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,821 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-04-27 12:39:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 781164454, now seen corresponding path program 11 times [2024-04-27 12:39:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:50,972 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-04-27 12:39:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1235942850, now seen corresponding path program 12 times [2024-04-27 12:39:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,171 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-04-27 12:39:51,177 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-04-27 12:39:51,192 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-04-27 12:39:51,205 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-04-27 12:39:51,225 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-04-27 12:39:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1236157065, now seen corresponding path program 4 times [2024-04-27 12:39:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-27 12:39:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-04-27 12:39:51,501 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-04-27 12:39:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -459201178, now seen corresponding path program 13 times [2024-04-27 12:39:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,590 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-04-27 12:39:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -64923999, now seen corresponding path program 14 times [2024-04-27 12:39:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,698 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-04-27 12:39:51,712 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-04-27 12:39:51,727 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-04-27 12:39:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1445147848, now seen corresponding path program 15 times [2024-04-27 12:39:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:51,878 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-04-27 12:39:51,895 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-04-27 12:39:51,910 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-04-27 12:39:51,929 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-04-27 12:39:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1444933633, now seen corresponding path program 16 times [2024-04-27 12:39:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:52,061 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-04-27 12:39:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -691482717, now seen corresponding path program 17 times [2024-04-27 12:39:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:52,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:52,321 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-04-27 12:39:52,325 INFO L85 PathProgramCache]: Analyzing trace with hash 909853542, now seen corresponding path program 5 times [2024-04-27 12:39:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:52,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:52,480 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-04-27 12:39:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 757920929, now seen corresponding path program 18 times [2024-04-27 12:39:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:52,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:52,671 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-04-27 12:39:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash -758691967, now seen corresponding path program 13 times [2024-04-27 12:39:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:52,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:52,749 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-04-27 12:39:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1575893116, now seen corresponding path program 14 times [2024-04-27 12:39:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-27 12:39:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-27 12:39:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash -256904457, now seen corresponding path program 1 times [2024-04-27 12:39:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:53,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-04-27 12:39:53,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-04-27 12:39:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -255964599, now seen corresponding path program 3 times [2024-04-27 12:39:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:54,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 655032098, now seen corresponding path program 4 times [2024-04-27 12:39:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:55,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 655032098, now seen corresponding path program 5 times [2024-04-27 12:39:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:55,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:39:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:39:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:39:55,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 12:39:55,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-27 12:39:55,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable50,SelfDestructingSolverStorable72,SelfDestructingSolverStorable51,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable52,SelfDestructingSolverStorable31,SelfDestructingSolverStorable53,SelfDestructingSolverStorable32,SelfDestructingSolverStorable54,SelfDestructingSolverStorable33,SelfDestructingSolverStorable55,SelfDestructingSolverStorable34,SelfDestructingSolverStorable56,SelfDestructingSolverStorable35,SelfDestructingSolverStorable57,SelfDestructingSolverStorable36,SelfDestructingSolverStorable58,SelfDestructingSolverStorable37,SelfDestructingSolverStorable59,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable40,SelfDestructingSolverStorable62,SelfDestructingSolverStorable41,SelfDestructingSolverStorable63,SelfDestructingSolverStorable42,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable43,SelfDestructingSolverStorable65,SelfDestructingSolverStorable44,SelfDestructingSolverStorable66,SelfDestructingSolverStorable45,SelfDestructingSolverStorable67,SelfDestructingSolverStorable46,SelfDestructingSolverStorable68,SelfDestructingSolverStorable47,SelfDestructingSolverStorable69,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable28 [2024-04-27 12:39:55,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-27 12:39:55,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:39:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1079533480, now seen corresponding path program 2 times [2024-04-27 12:39:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:39:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273419318] [2024-04-27 12:39:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:39:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:39:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:39:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-27 12:39:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:39:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273419318] [2024-04-27 12:39:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273419318] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:39:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974311713] [2024-04-27 12:39:55,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-27 12:39:55,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:39:55,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:39:55,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:39:55,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-27 12:39:55,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-27 12:39:55,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 12:39:55,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2024-04-27 12:39:55,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:39:55,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:39:55,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-04-27 12:39:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:55,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:39:55,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:39:55,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 51 [2024-04-27 12:39:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:39:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974311713] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 12:39:56,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 12:39:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 31 [2024-04-27 12:39:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525059703] [2024-04-27 12:39:56,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 12:39:56,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-27 12:39:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:39:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-27 12:39:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-04-27 12:39:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:39:56,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:39:56,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 12:39:56,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:39:56,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 12:39:56,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:40:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1291762956, now seen corresponding path program 6 times [2024-04-27 12:40:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:40:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:40:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:40:02,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:40:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:40:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1389946047, now seen corresponding path program 7 times [2024-04-27 12:40:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:40:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:40:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:40:02,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 12:40:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 12:40:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:40:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:40:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-04-27 12:40:02,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-27 12:40:03,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:40:03,060 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-27 12:40:03,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:40:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1129039339, now seen corresponding path program 3 times [2024-04-27 12:40:03,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:40:03,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15886226] [2024-04-27 12:40:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:40:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:40:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:40:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-04-27 12:40:03,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:40:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15886226] [2024-04-27 12:40:03,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15886226] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:40:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731030904] [2024-04-27 12:40:03,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-27 12:40:03,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:40:03,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:40:03,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:40:03,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-27 12:40:03,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-04-27 12:40:03,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 12:40:03,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 43 conjunts are in the unsatisfiable core [2024-04-27 12:40:03,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:40:04,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:40:04,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 26 [2024-04-27 12:40:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:40:04,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:40:05,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:40:05,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 63 treesize of output 267 [2024-04-27 12:40:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 7 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:40:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731030904] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 12:40:09,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 12:40:09,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27, 27] total 68 [2024-04-27 12:40:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477813903] [2024-04-27 12:40:09,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 12:40:09,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-04-27 12:40:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:40:09,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-04-27 12:40:09,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=4004, Unknown=0, NotChecked=0, Total=4556 [2024-04-27 12:40:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:40:09,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:40:09,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.838235294117647) internal successors, (125), 68 states have internal predecessors, (125), 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-04-27 12:40:09,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:40:09,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:40:09,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-04-27 12:40:09,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:40:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:40:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:40:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:40:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:40:34,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-27 12:40:34,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:40:34,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-27 12:40:34,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:40:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 307219019, now seen corresponding path program 4 times [2024-04-27 12:40:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:40:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928507323] [2024-04-27 12:40:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:40:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:40:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:40:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 6 proven. 102 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-04-27 12:40:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:40:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928507323] [2024-04-27 12:40:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928507323] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:40:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470051618] [2024-04-27 12:40:35,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-27 12:40:35,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:40:35,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:40:35,133 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:40:35,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-27 12:40:35,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-27 12:40:35,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 12:40:35,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 58 conjunts are in the unsatisfiable core [2024-04-27 12:40:35,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:40:36,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:40:36,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 34 [2024-04-27 12:40:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:40:36,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:40:38,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:40:38,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 87 treesize of output 511 [2024-04-27 12:40:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 7 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:40:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470051618] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 12:40:54,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 12:40:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 34, 34] total 78 [2024-04-27 12:40:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210867522] [2024-04-27 12:40:54,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 12:40:54,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-04-27 12:40:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:40:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-04-27 12:40:54,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=5287, Unknown=0, NotChecked=0, Total=6006 [2024-04-27 12:40:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:40:54,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:40:54,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 78 states have internal predecessors, (139), 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-04-27 12:40:54,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:40:54,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:40:54,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:40:54,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:40:54,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:41:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:41:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:41:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:41:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:41:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2024-04-27 12:41:29,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-04-27 12:41:29,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2024-04-27 12:41:29,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-27 12:41:29,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:41:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1463998417, now seen corresponding path program 5 times [2024-04-27 12:41:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:41:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740159521] [2024-04-27 12:41:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:41:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:41:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:41:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 8 proven. 172 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-04-27 12:41:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:41:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740159521] [2024-04-27 12:41:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740159521] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:41:30,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895119991] [2024-04-27 12:41:30,529 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-27 12:41:30,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:41:30,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:41:30,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:41:30,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-27 12:41:30,585 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-04-27 12:41:30,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 12:41:30,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 74 conjunts are in the unsatisfiable core [2024-04-27 12:41:30,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:41:32,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:41:32,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 110 treesize of output 42 [2024-04-27 12:41:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:41:32,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:41:35,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:41:35,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 111 treesize of output 835 [2024-04-27 12:42:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 15 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:42:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895119991] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 12:42:36,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 12:42:36,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 42, 42] total 96 [2024-04-27 12:42:36,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222212803] [2024-04-27 12:42:36,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 12:42:36,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-04-27 12:42:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:42:36,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-04-27 12:42:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=8092, Unknown=0, NotChecked=0, Total=9120 [2024-04-27 12:42:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:42:36,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:42:36,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.7291666666666667) internal successors, (166), 96 states have internal predecessors, (166), 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-04-27 12:42:36,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:42:36,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:42:36,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:42:36,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:42:36,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 274 states. [2024-04-27 12:42:36,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:45:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:45:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:45:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:45:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:45:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2024-04-27 12:45:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 950 states. [2024-04-27 12:45:47,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-04-27 12:45:47,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2024-04-27 12:45:47,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-27 12:45:47,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:45:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1656702303, now seen corresponding path program 6 times [2024-04-27 12:45:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:45:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714613855] [2024-04-27 12:45:47,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:45:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:45:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:45:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 10 proven. 260 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-04-27 12:45:48,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:45:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714613855] [2024-04-27 12:45:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714613855] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:45:48,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99908813] [2024-04-27 12:45:48,895 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-04-27 12:45:48,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:45:48,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:45:48,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:45:48,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-27 12:45:48,974 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-04-27 12:45:48,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 12:45:48,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 92 conjunts are in the unsatisfiable core [2024-04-27 12:45:48,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:45:56,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 12:45:56,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:45:56,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 21 select indices, 21 select index equivalence classes, 55 disjoint index pairs (out of 210 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 50 [2024-04-27 12:45:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:45:56,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:46:01,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,716 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:01,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 12:46:02,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:46:02,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 22 select indices, 22 select index equivalence classes, 155 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 76 case distinctions, treesize of input 132 treesize of output 786 [2024-04-27 12:46:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:46:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99908813] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 12:46:28,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 12:46:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 50, 50] total 123 [2024-04-27 12:46:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093927063] [2024-04-27 12:46:28,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 12:46:28,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2024-04-27 12:46:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 12:46:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2024-04-27 12:46:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2323, Invalid=12683, Unknown=0, NotChecked=0, Total=15006 [2024-04-27 12:46:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:46:28,347 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 12:46:28,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 1.7073170731707317) internal successors, (210), 123 states have internal predecessors, (210), 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-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 274 states. [2024-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 950 states. [2024-04-27 12:46:28,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 12:47:38,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-27 12:47:44,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-27 12:48:11,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-27 12:49:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 12:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-27 12:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-04-27 12:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2024-04-27 12:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2024-04-27 12:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 950 states. [2024-04-27 12:49:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 309 states. [2024-04-27 12:49:02,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-27 12:49:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:49:02,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-27 12:49:02,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 12:49:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2035772825, now seen corresponding path program 7 times [2024-04-27 12:49:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 12:49:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278945952] [2024-04-27 12:49:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 12:49:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 12:49:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:49:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 12 proven. 366 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-04-27 12:49:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 12:49:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278945952] [2024-04-27 12:49:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278945952] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 12:49:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203581063] [2024-04-27 12:49:03,732 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-04-27 12:49:03,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:49:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 12:49:03,734 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 12:49:03,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-04-27 12:49:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 12:49:03,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 106 conjunts are in the unsatisfiable core [2024-04-27 12:49:03,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 12:49:09,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:49:09,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 158 treesize of output 58 [2024-04-27 12:49:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 12:49:09,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 12:49:18,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 12:49:18,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 26 select indices, 26 select index equivalence classes, 0 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 325 case distinctions, treesize of input 159 treesize of output 1723 [2024-04-27 12:53:21,329 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-04-27 12:53:21,330 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-04-27 12:53:21,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-04-27 12:53:21,344 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 101 [2024-04-27 12:53:21,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 12:53:21,531 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-04-27 12:53:21,534 INFO L158 Benchmark]: Toolchain (without parser) took 817808.06ms. Allocated memory was 293.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 263.7MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2024-04-27 12:53:21,535 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-27 12:53:21,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.22ms. Allocated memory is still 293.6MB. Free memory was 263.5MB in the beginning and 262.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-27 12:53:21,535 INFO L158 Benchmark]: Boogie Preprocessor took 14.14ms. Allocated memory is still 293.6MB. Free memory was 261.9MB in the beginning and 260.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-27 12:53:21,535 INFO L158 Benchmark]: RCFGBuilder took 234.64ms. Allocated memory is still 293.6MB. Free memory was 260.9MB in the beginning and 250.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-04-27 12:53:21,535 INFO L158 Benchmark]: TraceAbstraction took 817496.06ms. Allocated memory was 293.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 249.3MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2024-04-27 12:53:21,536 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.10ms. Allocated memory is still 161.5MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.22ms. Allocated memory is still 293.6MB. Free memory was 263.5MB in the beginning and 262.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.14ms. Allocated memory is still 293.6MB. Free memory was 261.9MB in the beginning and 260.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 234.64ms. Allocated memory is still 293.6MB. Free memory was 260.9MB in the beginning and 250.5MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 817496.06ms. Allocated memory was 293.6MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 249.3MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-27 12:53:21,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...