/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 NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 11:01:24,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 11:01:24,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 11:01:24,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 11:01:24,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 11:01:24,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 11:01:24,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 11:01:24,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 11:01:24,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 11:01:24,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 11:01:24,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 11:01:24,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 11:01:24,236 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 11:01:24,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 11:01:24,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 11:01:24,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 11:01:24,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 11:01:24,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 11:01:24,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 11:01:24,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 11:01:24,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 11:01:24,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 11:01:24,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 11:01:24,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 11:01:24,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 11:01:24,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 11:01:24,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 11:01:24,241 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 11:01:24,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 11:01:24,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 11:01:24,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 11:01:24,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 11:01:24,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 11:01:24,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 11:01:24,244 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 11:01:24,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 11:01:24,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 11:01:24,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 11:01:24,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 11:01:24,245 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 -> NONE [2024-04-06 11:01:24,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 11:01:24,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 11:01:24,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 11:01:24,543 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 11:01:24,544 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 11:01:24,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl [2024-04-06 11:01:24,545 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl' [2024-04-06 11:01:24,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 11:01:24,585 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 11:01:24,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 11:01:24,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 11:01:24,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 11:01:24,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,626 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 11:01:24,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 11:01:24,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 11:01:24,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 11:01:24,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 11:01:24,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 11:01:24,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 11:01:24,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 11:01:24,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 11:01:24,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/1) ... [2024-04-06 11:01:24,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 11:01:24,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:24,719 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-06 11:01:24,745 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-06 11:01:24,769 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 11:01:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 11:01:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 11:01:24,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 11:01:24,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 11:01:24,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 11:01:24,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 11:01:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 11:01:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 11:01:24,771 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 11:01:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 11:01:24,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 11:01:24,771 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 11:01:24,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 11:01:24,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 11:01:24,772 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 11:01:24,830 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 11:01:24,832 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 11:01:24,936 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 11:01:24,957 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 11:01:24,958 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-06 11:01:24,959 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:01:24 BoogieIcfgContainer [2024-04-06 11:01:24,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 11:01:24,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 11:01:24,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 11:01:24,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 11:01:24,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 11:01:24" (1/2) ... [2024-04-06 11:01:24,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed2f2b and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:01:24, skipping insertion in model container [2024-04-06 11:01:24,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:01:24" (2/2) ... [2024-04-06 11:01:24,968 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2024-04-06 11:01:24,975 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 11:01:24,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 11:01:24,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 11:01:24,985 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 11:01:25,025 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-06 11:01:25,066 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 11:01:25,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 11:01:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:25,072 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-06 11:01:25,076 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-06 11:01:25,115 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 11:01:25,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 11:01:25,129 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;@12b7eeef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-06 11:01:25,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-06 11:01:25,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:25,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times [2024-04-06 11:01:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752861793] [2024-04-06 11:01:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:25,441 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-06 11:01:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752861793] [2024-04-06 11:01:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752861793] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:01:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:01:25,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-06 11:01:25,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543136145] [2024-04-06 11:01:25,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:01:25,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 11:01:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 11:01:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-06 11:01:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:25,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:25,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-06 11:01:25,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:25,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-06 11:01:25,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:25,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1570933513, now seen corresponding path program 1 times [2024-04-06 11:01:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536686277] [2024-04-06 11:01:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 11:01:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536686277] [2024-04-06 11:01:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536686277] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:01:26,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:01:26,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 11:01:26,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878606676] [2024-04-06 11:01:26,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:01:26,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 11:01:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 11:01:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 11:01:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:26,061 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:26,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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-06 11:01:26,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:26,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-06 11:01:26,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:26,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times [2024-04-06 11:01:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:26,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656451179] [2024-04-06 11:01:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:26,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:26,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:26,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656451179] [2024-04-06 11:01:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656451179] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:01:26,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:01:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 11:01:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063871152] [2024-04-06 11:01:26,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:01:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 11:01:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 11:01:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 11:01:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:26,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:26,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-06 11:01:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-06 11:01:26,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:26,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times [2024-04-06 11:01:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:26,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258951788] [2024-04-06 11:01:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 11:01:26,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:26,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258951788] [2024-04-06 11:01:26,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258951788] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:01:26,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:01:26,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 11:01:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420813329] [2024-04-06 11:01:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:01:26,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 11:01:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 11:01:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 11:01:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:26,656 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:26,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-06 11:01:26,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:26,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:26,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-06 11:01:26,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:26,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times [2024-04-06 11:01:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50077270] [2024-04-06 11:01:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:26,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 11:01:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50077270] [2024-04-06 11:01:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50077270] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 11:01:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468360174] [2024-04-06 11:01:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:27,080 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-06 11:01:27,100 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-06 11:01:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:27,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 11:01:27,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 11:01:27,330 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-06 11:01:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 11:01:27,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 11:01:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 11:01:27,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468360174] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 11:01:27,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 11:01:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-06 11:01:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389083622] [2024-04-06 11:01:27,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 11:01:27,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-06 11:01:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:27,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-06 11:01:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-06 11:01:27,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:27,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 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-06 11:01:27,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:27,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:27,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:27,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:27,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-06 11:01:28,206 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-06 11:01:28,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:28,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:28,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times [2024-04-06 11:01:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:28,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172656208] [2024-04-06 11:01:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:28,433 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-06 11:01:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:28,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172656208] [2024-04-06 11:01:28,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172656208] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:01:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:01:28,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 11:01:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408598447] [2024-04-06 11:01:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:01:28,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 11:01:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 11:01:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 11:01:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:28,435 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:28,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-06 11:01:28,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:28,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:28,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:28,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:28,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-06 11:01:28,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-06 11:01:29,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:29,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times [2024-04-06 11:01:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497006705] [2024-04-06 11:01:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:29,072 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-06 11:01:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497006705] [2024-04-06 11:01:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497006705] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:01:29,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:01:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 11:01:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666635652] [2024-04-06 11:01:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:01:29,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 11:01:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:29,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 11:01:29,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 11:01:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:29,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:29,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:29,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-06 11:01:29,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:29,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 2 times [2024-04-06 11:01:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784256725] [2024-04-06 11:01:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784256725] [2024-04-06 11:01:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784256725] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 11:01:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9663258] [2024-04-06 11:01:29,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 11:01:29,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:29,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:29,635 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-06 11:01:29,688 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-06 11:01:29,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 11:01:29,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 11:01:29,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2024-04-06 11:01:29,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 11:01:29,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 11 [2024-04-06 11:01:29,798 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 13 treesize of output 9 [2024-04-06 11:01:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:29,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 11:01:30,103 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-04-06 11:01:30,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 96 [2024-04-06 11:01:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:30,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9663258] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 11:01:30,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 11:01:30,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-04-06 11:01:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530842254] [2024-04-06 11:01:30,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 11:01:30,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-04-06 11:01:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-04-06 11:01:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-04-06 11:01:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:30,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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-06 11:01:30,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:30,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:30,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:30,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:30,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:30,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:30,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:30,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:01:31,537 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-06 11:01:31,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:31,736 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:31,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -604551849, now seen corresponding path program 3 times [2024-04-06 11:01:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:31,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396023421] [2024-04-06 11:01:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:31,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:31,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396023421] [2024-04-06 11:01:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396023421] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 11:01:31,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391030364] [2024-04-06 11:01:31,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-06 11:01:31,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:31,824 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-06 11:01:31,834 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-06 11:01:31,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-04-06 11:01:31,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 11:01:31,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2024-04-06 11:01:31,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 11:01:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 11:01:31,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 11:01:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 11:01:31,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391030364] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 11:01:31,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 11:01:31,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-04-06 11:01:31,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579317152] [2024-04-06 11:01:31,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 11:01:31,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-06 11:01:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-06 11:01:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-04-06 11:01:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:31,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:31,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:01:31,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:01:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:33,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-06 11:01:33,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:33,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:33,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1969997795, now seen corresponding path program 4 times [2024-04-06 11:01:33,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:33,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698368617] [2024-04-06 11:01:33,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698368617] [2024-04-06 11:01:33,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698368617] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 11:01:33,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511733668] [2024-04-06 11:01:33,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-06 11:01:33,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:33,366 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-06 11:01:33,384 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-06 11:01:33,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-06 11:01:33,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 11:01:33,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2024-04-06 11:01:33,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 11:01:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:33,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 11:01:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 11:01:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511733668] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 11:01:33,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 11:01:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-04-06 11:01:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43811066] [2024-04-06 11:01:33,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 11:01:33,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-06 11:01:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:01:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-06 11:01:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-04-06 11:01:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:33,525 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:01:33,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 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-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:33,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:01:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:01:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:01:36,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-06 11:01:36,547 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-06 11:01:36,742 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,SelfDestructingSolverStorable9 [2024-04-06 11:01:36,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:01:36,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:01:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash -847992609, now seen corresponding path program 5 times [2024-04-06 11:01:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:01:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956377280] [2024-04-06 11:01:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:01:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:01:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:01:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 11:01:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:01:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956377280] [2024-04-06 11:01:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956377280] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 11:01:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34075946] [2024-04-06 11:01:37,311 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-06 11:01:37,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:01:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 11:01:37,313 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-06 11:01:37,334 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-06 11:01:37,361 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-04-06 11:01:37,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 11:01:37,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 20 conjunts are in the unsatisfiable core [2024-04-06 11:01:37,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 11:01:37,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 11 [2024-04-06 11:01:37,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 11:01:37,532 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-04-06 11:01:37,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 53 [2024-04-06 11:01:37,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 11:01:37,819 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-04-06 11:01:37,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 53 [2024-04-06 11:01:37,876 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 13 treesize of output 9 [2024-04-06 11:01:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 11:01:37,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 11:01:39,970 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) is different from false [2024-04-06 11:01:42,032 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse0 (select c_A i))) (or (< c_min .cse0) (< .cse0 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse1 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (or (< c_min .cse1) (< (select c_A i) .cse1))))) is different from false [2024-04-06 11:01:44,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_l 1))) (and (forall ((v_l_23 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_26))) (let ((.cse0 (select .cse1 i))) (or (< .cse0 (+ (select (store .cse1 v_l_23 v_ArrVal_27) 0) 2)) (< c_min .cse0))))) (< v_l_23 .cse2))) (forall ((v_l_23 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse4 (store c_A c_l v_ArrVal_26))) (let ((.cse3 (+ (select (store .cse4 v_l_23 v_ArrVal_27) 0) 2))) (or (< c_min .cse3) (< (select .cse4 i) .cse3))))) (< v_l_23 .cse2))) (forall ((v_l_23 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse5 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store .cse5 v_l_23 v_ArrVal_27) 0) 2))) (forall ((i Int)) (<= (select .cse5 i) c_min))))) (< v_l_23 .cse2))))) is different from false [2024-04-06 11:02:27,991 WARN L293 SmtUtils]: Spent 8.88s on a formula simplification. DAG size of input: 883 DAG size of output: 880 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-06 11:02:27,991 INFO L349 Elim1Store]: treesize reduction 5, result has 99.7 percent of original size [2024-04-06 11:02:27,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 43754 treesize of output 42489 [2024-04-06 11:03:38,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,090 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,103 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,103 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 678 treesize of output 1 [2024-04-06 11:03:38,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,119 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,119 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 716 treesize of output 1 [2024-04-06 11:03:38,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,132 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,133 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 214 treesize of output 1 [2024-04-06 11:03:38,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,149 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,149 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 214 treesize of output 1 [2024-04-06 11:03:38,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,157 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,165 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,166 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 260 treesize of output 1 [2024-04-06 11:03:38,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,180 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,180 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 342 treesize of output 1 [2024-04-06 11:03:38,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,192 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,192 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 216 treesize of output 1 [2024-04-06 11:03:38,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,205 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,206 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 214 treesize of output 1 [2024-04-06 11:03:38,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-06 11:03:38,219 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-04-06 11:03:38,220 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 340 treesize of output 1 [2024-04-06 11:03:38,383 INFO L349 Elim1Store]: treesize reduction 1680, result has 0.1 percent of original size [2024-04-06 11:03:38,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 19566 treesize of output 1 [2024-04-06 11:03:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 9 trivial. 13 not checked. [2024-04-06 11:03:44,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34075946] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 11:03:44,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 11:03:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-04-06 11:03:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502520786] [2024-04-06 11:03:44,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 11:03:44,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-04-06 11:03:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:03:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-04-06 11:03:44,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=382, Unknown=18, NotChecked=132, Total=650 [2024-04-06 11:03:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:03:44,518 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:03:44,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:03:44,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:03:44,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:03:44,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:03:44,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-06 11:03:44,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:03:46,828 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] [2024-04-06 11:03:48,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-06 11:03:50,230 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] [2024-04-06 11:03:52,233 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] [2024-04-06 11:03:54,246 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] [2024-04-06 11:03:56,249 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] [2024-04-06 11:03:58,261 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] [2024-04-06 11:03:59,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-06 11:04:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:04:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-06 11:04:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-04-06 11:04:05,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-06 11:04:05,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 11:04:05,203 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 11:04:05,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 11:04:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 468809223, now seen corresponding path program 3 times [2024-04-06 11:04:05,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 11:04:05,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884275065] [2024-04-06 11:04:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 11:04:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 11:04:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 11:04:05,382 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-06 11:04:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 11:04:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884275065] [2024-04-06 11:04:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884275065] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 11:04:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 11:04:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 11:04:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006783289] [2024-04-06 11:04:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 11:04:05,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 11:04:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 11:04:05,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 11:04:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 11:04:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:04:05,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 11:04:05,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-04-06 11:04:05,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 11:04:24,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:04:26,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:04:28,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:04:30,085 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 [1] [2024-04-06 11:04:32,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:04:34,157 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 [1] [2024-04-06 11:04:36,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:03,717 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 [1] [2024-04-06 11:05:05,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:07,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:09,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:11,801 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 [1] [2024-04-06 11:05:13,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:16,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:18,211 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 [1] [2024-04-06 11:05:20,287 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 [1] [2024-04-06 11:05:22,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:24,370 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 [1] [2024-04-06 11:05:26,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:28,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:30,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:32,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:34,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:36,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:38,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:40,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:42,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:45,378 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 [1] [2024-04-06 11:05:47,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:49,439 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-06 11:05:51,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:05:53,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:13,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:15,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:17,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:19,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:21,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select c_A c_i)) (.cse52 (+ c_min 1)) (.cse0 (+ c_l 1)) (.cse1 (select c_A c_l))) (and (forall ((v_l_24 Int)) (or (< v_l_24 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse1) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int) (v_i_25 Int)) (let ((.cse4 (store c_A c_l v_ArrVal_25))) (let ((.cse3 (store .cse4 v_l_24 v_ArrVal_26))) (let ((.cse2 (select .cse3 v_i_25))) (or (< .cse2 (+ (select (store .cse3 v_l_23 v_ArrVal_27) 0) 2)) (< v_l_23 (+ v_l_24 1)) (< (select .cse4 i) .cse2) (< c_min .cse2)))))))))) (forall ((v_i_40 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_subst_3 Int)) (let ((.cse5 (store c_A c_l v_ArrVal_25))) (let ((.cse8 (store .cse5 v_l_24 v_ArrVal_26))) (let ((.cse6 (select .cse8 v_subst_3))) (or (< (select .cse5 v_i_40) (+ .cse6 1)) (< c_min .cse6) (< .cse7 .cse6) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse6 (+ (select (store .cse8 v_l_23 v_ArrVal_27) 0) 2))))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_24 Int) (v_l_23 Int)) (let ((.cse10 (store c_A c_l v_ArrVal_26))) (let ((.cse9 (+ (select (store .cse10 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select c_A i) .cse9) (< c_min .cse9) (< (select .cse10 v_i_24) .cse9) (< v_l_23 .cse0))))) (or (< c_min (+ 2 (select c_A 0))) (< .cse0 c_N)) (forall ((v_ArrVal_25 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_27 Int)) (let ((.cse14 (store c_A c_l v_ArrVal_25))) (let ((.cse12 (store .cse14 v_l_24 v_ArrVal_26))) (let ((.cse13 (select (store .cse12 v_l_23 v_ArrVal_27) 0)) (.cse11 (select .cse14 v_i_41))) (or (< .cse7 .cse11) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse12 v_i_27) (+ .cse13 3)) (< .cse11 (+ .cse13 2)) (< c_min .cse11)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_ArrVal_27 Int) (v_i_24 Int) (v_l_24 Int) (v_l_23 Int)) (let ((.cse15 (store c_A c_l v_ArrVal_25))) (let ((.cse17 (store .cse15 v_l_24 v_ArrVal_26))) (let ((.cse16 (+ (select (store .cse17 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select .cse15 v_i_44) .cse16) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse16) (< (select .cse17 v_i_24) .cse16) (< .cse7 .cse16)))))) (forall ((v_l_24 Int)) (or (< v_l_24 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse1) (forall ((i Int)) (let ((.cse21 (store c_A c_l v_ArrVal_25))) (let ((.cse18 (select .cse21 i))) (or (< c_min .cse18) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_26 Int)) (let ((.cse19 (store .cse21 v_l_24 v_ArrVal_26))) (let ((.cse20 (+ (select (store .cse19 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select .cse19 v_i_26) .cse20) (< v_l_23 (+ v_l_24 1)) (< .cse18 .cse20))))))))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_46 Int) (v_l_24 Int) (v_l_23 Int) (v_i_28 Int)) (let ((.cse25 (store c_A c_l v_ArrVal_25))) (let ((.cse24 (store .cse25 v_l_24 v_ArrVal_26))) (let ((.cse23 (select .cse24 v_i_28)) (.cse22 (select .cse25 v_i_46))) (or (< .cse22 .cse23) (< .cse7 .cse22) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse23 (+ (select (store .cse24 v_l_23 v_ArrVal_27) 0) 2)) (< c_min .cse22)))))) (forall ((v_l_24 Int)) (or (< v_l_24 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse1) (forall ((i Int)) (let ((.cse29 (store c_A c_l v_ArrVal_25))) (let ((.cse26 (select .cse29 i))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_28 Int)) (let ((.cse28 (store .cse29 v_l_24 v_ArrVal_26))) (let ((.cse27 (select .cse28 v_i_28))) (or (< .cse26 .cse27) (< v_l_23 (+ v_l_24 1)) (< .cse27 (+ (select (store .cse28 v_l_23 v_ArrVal_27) 0) 2)))))) (< c_min .cse26))))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_i_45 Int) (v_l_23 Int) (v_subst_1 Int)) (let ((.cse31 (store c_A c_l v_ArrVal_25))) (let ((.cse33 (store .cse31 v_l_24 v_ArrVal_26))) (let ((.cse34 (select (store .cse33 v_l_23 v_ArrVal_27) 0))) (let ((.cse30 (+ .cse34 2)) (.cse32 (+ .cse34 3))) (or (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse30) (< (select .cse31 v_i_45) .cse32) (< .cse7 .cse30) (< (select .cse33 v_subst_1) .cse32))))))) (forall ((i Int)) (let ((.cse35 (select c_A i))) (or (< c_min .cse35) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_28 Int)) (let ((.cse37 (store c_A c_l v_ArrVal_26))) (let ((.cse36 (select .cse37 v_i_28))) (or (< .cse36 (+ (select (store .cse37 v_l_23 v_ArrVal_27) 0) 2)) (< .cse35 .cse36) (< v_l_23 .cse0)))))))) (forall ((i Int)) (let ((.cse38 (select c_A i))) (or (< c_min .cse38) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_27 Int)) (let ((.cse40 (store c_A c_l v_ArrVal_26))) (let ((.cse39 (select (store .cse40 v_l_23 v_ArrVal_27) 0))) (or (< .cse38 (+ .cse39 2)) (< (select .cse40 v_i_27) (+ .cse39 3)) (< v_l_23 .cse0)))))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int) (v_i_25 Int)) (let ((.cse42 (store c_A c_l v_ArrVal_26))) (let ((.cse41 (select .cse42 v_i_25))) (or (< (select c_A i) .cse41) (< c_min .cse41) (< .cse41 (+ (select (store .cse42 v_l_23 v_ArrVal_27) 0) 2)) (< v_l_23 .cse0))))) (or (forall ((i Int)) (<= (select c_A i) c_min)) (and (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int)) (let ((.cse43 (store c_A c_l v_ArrVal_26))) (let ((.cse44 (select (store .cse43 v_l_23 v_ArrVal_27) 0))) (or (< (select .cse43 i) (+ .cse44 3)) (< c_min (+ .cse44 2)) (< v_l_23 .cse0))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int)) (let ((.cse46 (store c_A c_l v_ArrVal_26))) (let ((.cse45 (select .cse46 i))) (or (< .cse45 (+ (select (store .cse46 v_l_23 v_ArrVal_27) 0) 2)) (< c_min .cse45) (< v_l_23 .cse0))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int)) (let ((.cse48 (store c_A c_l v_ArrVal_26))) (let ((.cse47 (+ (select (store .cse48 v_l_23 v_ArrVal_27) 0) 2))) (or (< c_min .cse47) (< (select .cse48 i) .cse47) (< v_l_23 .cse0))))))) (forall ((v_l_24 Int)) (or (< v_l_24 .cse0) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse51 (store c_A c_l v_ArrVal_25))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_subst_2 Int)) (let ((.cse49 (store .cse51 v_l_24 v_ArrVal_26))) (let ((.cse50 (+ (select (store .cse49 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select .cse49 v_subst_2) .cse50) (< v_l_23 (+ v_l_24 1)) (< c_min .cse50))))) (< (+ v_ArrVal_25 1) .cse1) (< (select .cse51 i) .cse52)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_l_24 Int) (v_l_23 Int) (v_i_25 Int)) (let ((.cse55 (store c_A c_l v_ArrVal_25))) (let ((.cse54 (store .cse55 v_l_24 v_ArrVal_26))) (let ((.cse53 (select .cse54 v_i_25))) (or (< .cse53 (+ (select (store .cse54 v_l_23 v_ArrVal_27) 0) 2)) (< .cse7 .cse53) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse55 v_i_43) .cse53) (< c_min .cse53)))))) (forall ((v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_i_23 Int) (v_l_23 Int)) (let ((.cse56 (store c_A c_l v_ArrVal_25))) (let ((.cse58 (store .cse56 v_l_24 v_ArrVal_26))) (let ((.cse59 (select (store .cse58 v_l_23 v_ArrVal_27) 0))) (let ((.cse57 (+ .cse59 2))) (or (< (select .cse56 v_i_42) .cse57) (< v_l_24 .cse0) (< (select .cse58 v_i_23) (+ .cse59 3)) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse57) (< .cse7 .cse57))))))) (forall ((v_l_24 Int)) (or (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse62 (store c_A c_l v_ArrVal_25))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_subst_1 Int)) (let ((.cse61 (store .cse62 v_l_24 v_ArrVal_26))) (let ((.cse60 (select (store .cse61 v_l_23 v_ArrVal_27) 0))) (or (< v_l_23 (+ v_l_24 1)) (< c_min (+ .cse60 2)) (< (select .cse61 v_subst_1) (+ .cse60 3)))))) (< (+ v_ArrVal_25 1) .cse1) (< (select .cse62 i) .cse52)))) (< v_l_24 .cse0))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_26 Int) (v_i_39 Int)) (let ((.cse66 (store c_A c_l v_ArrVal_25))) (let ((.cse63 (store .cse66 v_l_24 v_ArrVal_26))) (let ((.cse64 (+ (select (store .cse63 v_l_23 v_ArrVal_27) 0) 2)) (.cse65 (select .cse66 v_i_39))) (or (< (select .cse63 v_i_26) .cse64) (< v_l_24 .cse0) (< .cse65 .cse64) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse7 .cse65) (< c_min .cse65)))))) (or (and (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_24 Int) (v_l_24 Int) (v_subst_4 Int) (v_l_23 Int)) (let ((.cse67 (store c_A c_l v_ArrVal_25))) (let ((.cse69 (store .cse67 v_l_24 v_ArrVal_26))) (let ((.cse68 (+ (select (store .cse69 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select .cse67 v_subst_4) .cse68) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse68) (< (select .cse69 v_i_24) .cse68)))))) (forall ((v_subst_12 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_subst_1 Int)) (let ((.cse70 (store c_A c_l v_ArrVal_25))) (let ((.cse73 (store .cse70 v_l_24 v_ArrVal_26))) (let ((.cse72 (select (store .cse73 v_l_23 v_ArrVal_27) 0))) (let ((.cse71 (+ .cse72 3))) (or (< (select .cse70 v_subst_12) .cse71) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min (+ .cse72 2)) (< (select .cse73 v_subst_1) .cse71))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_subst_8 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_25 Int)) (let ((.cse76 (store c_A c_l v_ArrVal_25))) (let ((.cse75 (store .cse76 v_l_24 v_ArrVal_26))) (let ((.cse74 (select .cse75 v_i_25))) (or (< .cse74 (+ (select (store .cse75 v_l_23 v_ArrVal_27) 0) 2)) (< (select .cse76 v_subst_8) .cse74) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse74)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_7 Int) (v_l_24 Int) (v_l_23 Int) (v_subst_2 Int)) (let ((.cse79 (store c_A c_l v_ArrVal_25))) (let ((.cse77 (store .cse79 v_l_24 v_ArrVal_26))) (let ((.cse80 (select (store .cse77 v_l_23 v_ArrVal_27) 0))) (let ((.cse78 (+ .cse80 2))) (or (< (select .cse77 v_subst_2) .cse78) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse78) (< (select .cse79 v_subst_7) (+ .cse80 3)))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_6 Int) (v_l_24 Int) (v_l_23 Int) (v_i_28 Int)) (let ((.cse84 (store c_A c_l v_ArrVal_25))) (let ((.cse83 (store .cse84 v_l_24 v_ArrVal_26))) (let ((.cse81 (select .cse84 v_subst_6)) (.cse82 (select .cse83 v_i_28))) (or (< .cse81 .cse82) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse81) (< .cse82 (+ (select (store .cse83 v_l_23 v_ArrVal_27) 0) 2))))))) (forall ((v_ArrVal_25 Int) (v_subst_9 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_27 Int)) (let ((.cse88 (store c_A c_l v_ArrVal_25))) (let ((.cse87 (store .cse88 v_l_24 v_ArrVal_26))) (let ((.cse85 (select .cse88 v_subst_9)) (.cse86 (select (store .cse87 v_l_23 v_ArrVal_27) 0))) (or (< .cse85 (+ .cse86 2)) (< c_min .cse85) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse87 v_i_27) (+ .cse86 3))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_subst_5 Int) (v_l_24 Int) (v_i_23 Int) (v_l_23 Int)) (let ((.cse89 (store c_A c_l v_ArrVal_25))) (let ((.cse91 (store .cse89 v_l_24 v_ArrVal_26))) (let ((.cse92 (select (store .cse91 v_l_23 v_ArrVal_27) 0))) (let ((.cse90 (+ .cse92 2))) (or (< (select .cse89 v_subst_5) .cse90) (< v_l_24 .cse0) (< (select .cse91 v_i_23) (+ .cse92 3)) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse90))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_26 Int) (v_subst_10 Int)) (let ((.cse96 (store c_A c_l v_ArrVal_25))) (let ((.cse93 (store .cse96 v_l_24 v_ArrVal_26))) (let ((.cse95 (select .cse96 v_subst_10)) (.cse94 (+ (select (store .cse93 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select .cse93 v_i_26) .cse94) (< c_min .cse95) (< v_l_24 .cse0) (< .cse95 .cse94) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_subst_3 Int) (v_subst_11 Int)) (let ((.cse97 (store c_A c_l v_ArrVal_25))) (let ((.cse99 (store .cse97 v_l_24 v_ArrVal_26))) (let ((.cse98 (select .cse99 v_subst_3))) (or (< (select .cse97 v_subst_11) (+ .cse98 1)) (< c_min .cse98) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse98 (+ (select (store .cse99 v_l_23 v_ArrVal_27) 0) 2)))))))) (< .cse7 .cse52)) (forall ((v_l_24 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_23 Int) (v_l_23 Int)) (let ((.cse103 (store c_A c_l v_ArrVal_25))) (let ((.cse100 (store .cse103 v_l_24 v_ArrVal_26))) (let ((.cse101 (select (store .cse100 v_l_23 v_ArrVal_27) 0))) (let ((.cse102 (+ .cse101 2))) (or (< (select .cse100 v_i_23) (+ .cse101 3)) (< v_l_23 (+ v_l_24 1)) (< c_min .cse102) (< (select .cse103 i) .cse102))))))) (< (+ v_ArrVal_25 1) .cse1))) (< v_l_24 .cse0))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_subst_2 Int) (v_i_38 Int)) (let ((.cse104 (store c_A c_l v_ArrVal_25))) (let ((.cse106 (store .cse104 v_l_24 v_ArrVal_26))) (let ((.cse105 (select (store .cse106 v_l_23 v_ArrVal_27) 0))) (let ((.cse107 (+ .cse105 2))) (or (< (select .cse104 v_i_38) (+ .cse105 3)) (< (select .cse106 v_subst_2) .cse107) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< c_min .cse107) (< .cse7 .cse107))))))) (forall ((i Int)) (let ((.cse108 (select c_A i))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_26 Int)) (let ((.cse110 (store c_A c_l v_ArrVal_26))) (let ((.cse109 (+ (select (store .cse110 v_l_23 v_ArrVal_27) 0) 2))) (or (< .cse108 .cse109) (< (select .cse110 v_i_26) .cse109) (< v_l_23 .cse0))))) (< c_min .cse108)))) (or (and (forall ((v_i_53 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_25 Int)) (let ((.cse113 (store c_A c_l v_ArrVal_25))) (let ((.cse112 (store .cse113 v_l_24 v_ArrVal_26))) (let ((.cse111 (select .cse112 v_i_25))) (or (< .cse111 (+ (select (store .cse112 v_l_23 v_ArrVal_27) 0) 2)) (< .cse7 .cse111) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse113 v_i_53) .cse111)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_47 Int) (v_i_27 Int)) (let ((.cse117 (store c_A c_l v_ArrVal_25))) (let ((.cse116 (store .cse117 v_l_24 v_ArrVal_26))) (let ((.cse114 (select .cse117 v_i_47)) (.cse115 (select (store .cse116 v_l_23 v_ArrVal_27) 0))) (or (< .cse7 .cse114) (< .cse114 (+ .cse115 2)) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse116 v_i_27) (+ .cse115 3))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_48 Int) (v_subst_3 Int)) (let ((.cse119 (store c_A c_l v_ArrVal_25))) (let ((.cse120 (store .cse119 v_l_24 v_ArrVal_26))) (let ((.cse118 (select .cse120 v_subst_3))) (or (< .cse7 .cse118) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse119 v_i_48) (+ .cse118 1)) (< .cse118 (+ (select (store .cse120 v_l_23 v_ArrVal_27) 0) 2))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_55 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_subst_2 Int)) (let ((.cse123 (store c_A c_l v_ArrVal_25))) (let ((.cse121 (store .cse123 v_l_24 v_ArrVal_26))) (let ((.cse124 (select (store .cse121 v_l_23 v_ArrVal_27) 0))) (let ((.cse122 (+ .cse124 2))) (or (< (select .cse121 v_subst_2) .cse122) (< v_l_24 .cse0) (< (select .cse123 v_i_55) (+ .cse124 3)) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse7 .cse122))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_54 Int) (v_l_24 Int) (v_l_23 Int) (v_i_28 Int)) (let ((.cse128 (store c_A c_l v_ArrVal_25))) (let ((.cse127 (store .cse128 v_l_24 v_ArrVal_26))) (let ((.cse125 (select .cse128 v_i_54)) (.cse126 (select .cse127 v_i_28))) (or (< .cse7 .cse125) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse126 (+ (select (store .cse127 v_l_23 v_ArrVal_27) 0) 2)) (< .cse125 .cse126)))))) (forall ((v_i_50 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_26 Int)) (let ((.cse132 (store c_A c_l v_ArrVal_25))) (let ((.cse129 (store .cse132 v_l_24 v_ArrVal_26))) (let ((.cse130 (+ (select (store .cse129 v_l_23 v_ArrVal_27) 0) 2)) (.cse131 (select .cse132 v_i_50))) (or (< (select .cse129 v_i_26) .cse130) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< .cse131 .cse130) (< v_l_23 (+ v_l_24 1)) (< .cse7 .cse131)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_l_23 Int) (v_i_49 Int) (v_subst_1 Int)) (let ((.cse133 (store c_A c_l v_ArrVal_25))) (let ((.cse136 (store .cse133 v_l_24 v_ArrVal_26))) (let ((.cse135 (select (store .cse136 v_l_23 v_ArrVal_27) 0))) (let ((.cse134 (+ .cse135 3))) (or (< (select .cse133 v_i_49) .cse134) (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse7 (+ .cse135 2)) (< (select .cse136 v_subst_1) .cse134))))))) (forall ((v_i_51 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_i_24 Int) (v_l_24 Int) (v_l_23 Int)) (let ((.cse139 (store c_A c_l v_ArrVal_25))) (let ((.cse137 (store .cse139 v_l_24 v_ArrVal_26))) (let ((.cse138 (+ (select (store .cse137 v_l_23 v_ArrVal_27) 0) 2))) (or (< v_l_24 .cse0) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< (select .cse137 v_i_24) .cse138) (< .cse7 .cse138) (< (select .cse139 v_i_51) .cse138)))))) (forall ((v_ArrVal_25 Int) (v_i_52 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_24 Int) (v_i_23 Int) (v_l_23 Int)) (let ((.cse140 (store c_A c_l v_ArrVal_25))) (let ((.cse142 (store .cse140 v_l_24 v_ArrVal_26))) (let ((.cse143 (select (store .cse142 v_l_23 v_ArrVal_27) 0))) (let ((.cse141 (+ .cse143 2))) (or (< (select .cse140 v_i_52) .cse141) (< v_l_24 .cse0) (< (select .cse142 v_i_23) (+ .cse143 3)) (< (+ v_ArrVal_25 1) .cse1) (< v_l_23 (+ v_l_24 1)) (< .cse7 .cse141)))))))) (< c_min .cse7)) (forall ((v_l_24 Int)) (or (< v_l_24 .cse0) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse1) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_24 Int) (v_l_23 Int)) (let ((.cse145 (store c_A c_l v_ArrVal_25))) (let ((.cse146 (store .cse145 v_l_24 v_ArrVal_26))) (let ((.cse144 (+ (select (store .cse146 v_l_23 v_ArrVal_27) 0) 2))) (or (< v_l_23 (+ v_l_24 1)) (< c_min .cse144) (< (select .cse145 i) .cse144) (< (select .cse146 v_i_24) .cse144)))))))))) (< 0 .cse0) (forall ((v_l_24 Int)) (or (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse149 (store c_A c_l v_ArrVal_25))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_subst_3 Int)) (let ((.cse148 (store .cse149 v_l_24 v_ArrVal_26))) (let ((.cse147 (select .cse148 v_subst_3))) (or (< c_min .cse147) (< v_l_23 (+ v_l_24 1)) (< .cse147 (+ (select (store .cse148 v_l_23 v_ArrVal_27) 0) 2)))))) (< (+ v_ArrVal_25 1) .cse1) (< (select .cse149 i) .cse52)))) (< v_l_24 .cse0))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_23 Int) (v_l_23 Int)) (let ((.cse151 (store c_A c_l v_ArrVal_26))) (let ((.cse152 (select (store .cse151 v_l_23 v_ArrVal_27) 0))) (let ((.cse150 (+ .cse152 2))) (or (< (select c_A i) .cse150) (< c_min .cse150) (< (select .cse151 v_i_23) (+ .cse152 3)) (< v_l_23 .cse0)))))) (forall ((v_l_24 Int)) (or (< v_l_24 .cse0) (forall ((v_ArrVal_25 Int)) (or (forall ((i Int)) (let ((.cse156 (store c_A c_l v_ArrVal_25))) (let ((.cse155 (select .cse156 i))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_27 Int)) (let ((.cse153 (store .cse156 v_l_24 v_ArrVal_26))) (let ((.cse154 (select (store .cse153 v_l_23 v_ArrVal_27) 0))) (or (< v_l_23 (+ v_l_24 1)) (< (select .cse153 v_i_27) (+ .cse154 3)) (< .cse155 (+ .cse154 2)))))) (< c_min .cse155))))) (< (+ v_ArrVal_25 1) .cse1))))))) is different from false [2024-04-06 11:06:24,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:26,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:28,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:30,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:32,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:34,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:36,134 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 [1] [2024-04-06 11:06:54,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:56,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:06:58,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:00,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:02,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:04,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:06,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:08,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:10,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:12,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:14,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:16,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:18,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:20,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:22,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:24,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:26,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:28,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:30,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:32,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:34,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:36,434 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 [1] [2024-04-06 11:07:38,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:40,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:42,499 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 [1] [2024-04-06 11:07:44,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:46,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:48,563 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 [1] [2024-04-06 11:07:50,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:52,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:54,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:56,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:07:58,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:00,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-04-06 11:08:02,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:22,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:24,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:26,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:28,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:30,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:32,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:34,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:08:36,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:03,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:05,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:07,612 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 [1] [2024-04-06 11:09:09,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:11,871 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-06 11:09:27,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:49,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:51,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:53,641 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 [1] [2024-04-06 11:09:55,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:57,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:09:59,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:01,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:03,785 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-06 11:10:29,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:31,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:33,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:35,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:37,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:39,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:41,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:43,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:46,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:10:48,064 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((i Int)) (<= (select c_A i) c_min))) (.cse3 (+ c_l 1))) (and (or (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) .cse0) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_24 Int) (v_l_23 Int)) (let ((.cse2 (store c_A c_l v_ArrVal_26))) (let ((.cse1 (+ (select (store .cse2 v_l_23 v_ArrVal_27) 0) 2))) (or (< (select c_A i) .cse1) (< c_min .cse1) (< (select .cse2 v_i_24) .cse1) (< v_l_23 .cse3))))) (or (< c_min (+ 2 (select c_A 0))) (< .cse3 c_N)) (forall ((i Int)) (let ((.cse4 (select c_A i))) (or (< c_min .cse4) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_28 Int)) (let ((.cse6 (store c_A c_l v_ArrVal_26))) (let ((.cse5 (select .cse6 v_i_28))) (or (< .cse5 (+ (select (store .cse6 v_l_23 v_ArrVal_27) 0) 2)) (< .cse4 .cse5) (< v_l_23 .cse3)))))))) (forall ((i Int)) (let ((.cse7 (select c_A i))) (or (< c_min .cse7) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_27 Int)) (let ((.cse9 (store c_A c_l v_ArrVal_26))) (let ((.cse8 (select (store .cse9 v_l_23 v_ArrVal_27) 0))) (or (< .cse7 (+ .cse8 2)) (< (select .cse9 v_i_27) (+ .cse8 3)) (< v_l_23 .cse3)))))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int) (v_i_25 Int)) (let ((.cse11 (store c_A c_l v_ArrVal_26))) (let ((.cse10 (select .cse11 v_i_25))) (or (< (select c_A i) .cse10) (< c_min .cse10) (< .cse10 (+ (select (store .cse11 v_l_23 v_ArrVal_27) 0) 2)) (< v_l_23 .cse3))))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse12 (select c_A i))) (or (< c_min .cse12) (< .cse12 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))))) (or .cse0 (and (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int)) (let ((.cse13 (store c_A c_l v_ArrVal_26))) (let ((.cse14 (select (store .cse13 v_l_23 v_ArrVal_27) 0))) (or (< (select .cse13 i) (+ .cse14 3)) (< c_min (+ .cse14 2)) (< v_l_23 .cse3))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int)) (let ((.cse16 (store c_A c_l v_ArrVal_26))) (let ((.cse15 (select .cse16 i))) (or (< .cse15 (+ (select (store .cse16 v_l_23 v_ArrVal_27) 0) 2)) (< c_min .cse15) (< v_l_23 .cse3))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_23 Int)) (let ((.cse18 (store c_A c_l v_ArrVal_26))) (let ((.cse17 (+ (select (store .cse18 v_l_23 v_ArrVal_27) 0) 2))) (or (< c_min .cse17) (< (select .cse18 i) .cse17) (< v_l_23 .cse3))))))) (forall ((v_ArrVal_27 Int) (i Int)) (let ((.cse19 (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (or (< c_min .cse19) (< (select c_A i) .cse19)))) (forall ((i Int)) (let ((.cse20 (select c_A i))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_23 Int) (v_i_26 Int)) (let ((.cse22 (store c_A c_l v_ArrVal_26))) (let ((.cse21 (+ (select (store .cse22 v_l_23 v_ArrVal_27) 0) 2))) (or (< .cse20 .cse21) (< (select .cse22 v_i_26) .cse21) (< v_l_23 .cse3))))) (< c_min .cse20)))) (< 0 .cse3) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_i_23 Int) (v_l_23 Int)) (let ((.cse24 (store c_A c_l v_ArrVal_26))) (let ((.cse25 (select (store .cse24 v_l_23 v_ArrVal_27) 0))) (let ((.cse23 (+ .cse25 2))) (or (< (select c_A i) .cse23) (< c_min .cse23) (< (select .cse24 v_i_23) (+ .cse25 3)) (< v_l_23 .cse3)))))))) is different from false [2024-04-06 11:11:27,742 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 [1] [2024-04-06 11:11:29,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:11:31,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:11:33,892 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-06 11:11:35,948 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 [1] [2024-04-06 11:11:37,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:11:39,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-04-06 11:12:18,548 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-06 11:12:18,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-04-06 11:12:18,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-06 11:12:18,550 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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) 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) ... 55 more [2024-04-06 11:12:18,558 INFO L158 Benchmark]: Toolchain (without parser) took 653973.04ms. Allocated memory was 152.0MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 119.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 720.9MB. Max. memory is 8.0GB. [2024-04-06 11:12:18,558 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 152.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 11:12:18,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.09ms. Allocated memory was 152.0MB in the beginning and 256.9MB in the end (delta: 104.9MB). Free memory was 119.3MB in the beginning and 225.3MB in the end (delta: -106.0MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2024-04-06 11:12:18,559 INFO L158 Benchmark]: Boogie Preprocessor took 28.32ms. Allocated memory is still 256.9MB. Free memory was 231.2MB in the beginning and 230.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 11:12:18,559 INFO L158 Benchmark]: RCFGBuilder took 283.08ms. Allocated memory is still 256.9MB. Free memory was 230.1MB in the beginning and 219.0MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-06 11:12:18,559 INFO L158 Benchmark]: TraceAbstraction took 653595.20ms. Allocated memory was 256.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 217.8MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 714.9MB. Max. memory is 8.0GB. [2024-04-06 11:12:18,565 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.11ms. Allocated memory is still 152.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.09ms. Allocated memory was 152.0MB in the beginning and 256.9MB in the end (delta: 104.9MB). Free memory was 119.3MB in the beginning and 225.3MB in the end (delta: -106.0MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.32ms. Allocated memory is still 256.9MB. Free memory was 231.2MB in the beginning and 230.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 283.08ms. Allocated memory is still 256.9MB. Free memory was 230.1MB in the beginning and 219.0MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 653595.20ms. Allocated memory was 256.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 217.8MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 714.9MB. 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-06 11:12:18,595 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...