/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 IA --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -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-17da818-m [2024-05-04 03:03:06,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 03:03:07,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 03:03:07,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 03:03:07,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 03:03:07,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 03:03:07,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 03:03:07,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 03:03:07,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 03:03:07,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 03:03:07,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 03:03:07,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 03:03:07,087 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 03:03:07,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 03:03:07,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 03:03:07,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 03:03:07,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 03:03:07,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 03:03:07,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 03:03:07,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 03:03:07,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 03:03:07,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 03:03:07,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 03:03:07,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 03:03:07,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 03:03:07,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 03:03:07,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 03:03:07,091 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 03:03:07,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 03:03:07,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 03:03:07,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 03:03:07,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 03:03:07,093 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 03:03:07,093 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-05-04 03:03:07,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 03:03:07,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 03:03:07,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 03:03:07,267 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-05-04 03:03:07,268 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-05-04 03:03:07,269 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-05-04 03:03:07,269 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-05-04 03:03:07,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 03:03:07,298 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-05-04 03:03:07,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 03:03:07,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 03:03:07,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 03:03:07,307 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,313 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,317 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-05-04 03:03:07,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 03:03:07,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 03:03:07,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 03:03:07,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 03:03:07,375 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,376 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,377 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,377 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,384 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,387 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,389 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,389 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 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 03:03:07,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 03:03:07,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 03:03:07,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 03:03:07,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 03:03:07" (1/1) ... [2024-05-04 03:03:07,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 03:03:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:07,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-04 03:03:07,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-04 03:03:07,507 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-05-04 03:03:07,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-04 03:03:07,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-04 03:03:07,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-05-04 03:03:07,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-04 03:03:07,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-04 03:03:07,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-05-04 03:03:07,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 03:03:07,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 03:03:07,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-05-04 03:03:07,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-04 03:03:07,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-04 03:03:07,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-05-04 03:03:07,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-04 03:03:07,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-04 03:03:07,510 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 03:03:07,554 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 03:03:07,556 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 03:03:07,637 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 03:03:07,650 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 03:03:07,650 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-04 03:03:07,651 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:03:07 BoogieIcfgContainer [2024-05-04 03:03:07,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 03:03:07,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 03:03:07,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 03:03:07,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 03:03:07,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 03:03:07" (1/2) ... [2024-05-04 03:03:07,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26bd9876 and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:03:07, skipping insertion in model container [2024-05-04 03:03:07,658 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 04.05 03:03:07" (2/2) ... [2024-05-04 03:03:07,660 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2024-05-04 03:03:07,666 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 03:03:07,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 03:03:07,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 03:03:07,674 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 03:03:07,721 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-04 03:03:07,766 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 03:03:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 03:03:07,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:07,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-04 03:03:07,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-04 03:03:07,806 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 03:03:07,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:07,816 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 03:03:07,822 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;@6b67dfe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-05-04 03:03:07,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-04 03:03:07,855 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-05-04 03:03:07,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times [2024-05-04 03:03:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71835987] [2024-05-04 03:03:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71835987] [2024-05-04 03:03:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71835987] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:03:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:03:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-04 03:03:08,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177846466] [2024-05-04 03:03:08,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:03:08,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-04 03:03:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 03:03:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-04 03:03:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:08,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:08,140 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-05-04 03:03:08,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:08,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-04 03:03:08,489 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-05-04 03:03:08,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1570933513, now seen corresponding path program 1 times [2024-05-04 03:03:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:08,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575382152] [2024-05-04 03:03:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-04 03:03:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575382152] [2024-05-04 03:03:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575382152] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:03:08,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:03:08,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 03:03:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635062573] [2024-05-04 03:03:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:03:08,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-04 03:03:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 03:03:08,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-04 03:03:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:08,575 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:08,575 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-05-04 03:03:08,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:08,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:08,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:08,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-04 03:03:08,718 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-05-04 03:03:08,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times [2024-05-04 03:03:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736686891] [2024-05-04 03:03:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736686891] [2024-05-04 03:03:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736686891] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:03:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:03:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-04 03:03:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770002174] [2024-05-04 03:03:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:03:08,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-04 03:03:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 03:03:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-04 03:03:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:08,826 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:08,827 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-05-04 03:03:08,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:08,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:08,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:08,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-04 03:03:08,937 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-05-04 03:03:08,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times [2024-05-04 03:03:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351850311] [2024-05-04 03:03:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351850311] [2024-05-04 03:03:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351850311] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:03:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:03:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-04 03:03:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296794201] [2024-05-04 03:03:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:03:09,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-04 03:03:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:09,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 03:03:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-04 03:03:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:09,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:09,015 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-05-04 03:03:09,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:09,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-04 03:03:09,195 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-05-04 03:03:09,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times [2024-05-04 03:03:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783984655] [2024-05-04 03:03:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:09,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:09,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783984655] [2024-05-04 03:03:09,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783984655] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 03:03:09,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482988553] [2024-05-04 03:03:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:09,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 03:03:09,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:09,493 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-05-04 03:03:09,509 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-05-04 03:03:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:09,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-04 03:03:09,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 03:03:09,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-04 03:03:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:09,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 03:03:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:09,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482988553] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 03:03:09,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 03:03:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-05-04 03:03:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894975556] [2024-05-04 03:03:09,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 03:03:09,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-04 03:03:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:09,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-04 03:03:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-05-04 03:03:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:09,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:09,987 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-05-04 03:03:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-04 03:03:10,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-04 03:03:10,584 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-05-04 03:03:10,585 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-05-04 03:03:10,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times [2024-05-04 03:03:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:10,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530128306] [2024-05-04 03:03:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530128306] [2024-05-04 03:03:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530128306] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:03:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:03:10,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 03:03:10,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123576107] [2024-05-04 03:03:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:03:10,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-04 03:03:10,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 03:03:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-04 03:03:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:10,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:10,612 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-05-04 03:03:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-04 03:03:10,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-04 03:03:11,046 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-05-04 03:03:11,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times [2024-05-04 03:03:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439039064] [2024-05-04 03:03:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:11,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439039064] [2024-05-04 03:03:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439039064] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:03:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:03:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 03:03:11,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065024811] [2024-05-04 03:03:11,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:03:11,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-04 03:03:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:11,195 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 7 treesize of output 5 [2024-05-04 03:03:11,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-05-04 03:03:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash 692199915, now seen corresponding path program 1 times [2024-05-04 03:03:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:03:11,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 03:03:11,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-04 03:03:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:11,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:11,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:11,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2024-05-04 03:03:11,509 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-05-04 03:03:11,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 2 times [2024-05-04 03:03:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142930747] [2024-05-04 03:03:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142930747] [2024-05-04 03:03:11,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142930747] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 03:03:11,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156397069] [2024-05-04 03:03:11,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 03:03:11,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 03:03:11,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:11,613 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-05-04 03:03:11,628 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-05-04 03:03:11,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 03:03:11,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 03:03:11,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-04 03:03:11,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 03:03:11,776 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-05-04 03:03:11,785 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-05-04 03:03:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:11,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 03:03:11,939 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-05-04 03:03:11,940 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 33 treesize of output 44 [2024-05-04 03:03:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156397069] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 03:03:11,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 03:03:11,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-05-04 03:03:11,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626569804] [2024-05-04 03:03:11,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 03:03:11,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-04 03:03:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:11,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-04 03:03:11,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-04 03:03:11,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:11,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:11,964 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-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:11,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:11,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:03:12,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-04 03:03:13,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-04 03:03:13,156 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-05-04 03:03:13,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -604551849, now seen corresponding path program 3 times [2024-05-04 03:03:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283230099] [2024-05-04 03:03:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283230099] [2024-05-04 03:03:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283230099] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 03:03:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354357417] [2024-05-04 03:03:13,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-04 03:03:13,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 03:03:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:13,246 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-05-04 03:03:13,306 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-05-04 03:03:13,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-05-04 03:03:13,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 03:03:13,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2024-05-04 03:03:13,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 03:03:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-04 03:03:13,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 03:03:13,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-04 03:03:13,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354357417] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 03:03:13,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 03:03:13,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-05-04 03:03:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223289209] [2024-05-04 03:03:13,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 03:03:13,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-04 03:03:13,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-04 03:03:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-04 03:03:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:13,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:13,375 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-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:13,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:13,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:03:13,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:03:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:14,333 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-05-04 03:03:14,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 03:03:14,527 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-05-04 03:03:14,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1969997795, now seen corresponding path program 4 times [2024-05-04 03:03:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349106364] [2024-05-04 03:03:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349106364] [2024-05-04 03:03:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349106364] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 03:03:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727546509] [2024-05-04 03:03:14,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-04 03:03:14,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 03:03:14,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:14,581 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-05-04 03:03:14,611 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-05-04 03:03:14,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-04 03:03:14,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 03:03:14,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-04 03:03:14,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 03:03:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:14,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 03:03:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 03:03:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727546509] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 03:03:14,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 03:03:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-05-04 03:03:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529000661] [2024-05-04 03:03:14,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 03:03:14,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-04 03:03:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:03:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-04 03:03:14,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-05-04 03:03:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:14,721 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:03:14,721 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-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:14,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:03:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:03:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-04 03:03:17,300 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-05-04 03:03:17,498 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,SelfDestructingSolverStorable11 [2024-05-04 03:03:17,498 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-05-04 03:03:17,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:03:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -847992609, now seen corresponding path program 5 times [2024-05-04 03:03:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:03:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260102049] [2024-05-04 03:03:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:03:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:03:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:03:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-04 03:03:17,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:03:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260102049] [2024-05-04 03:03:17,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260102049] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 03:03:17,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994382341] [2024-05-04 03:03:17,871 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-04 03:03:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 03:03:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 03:03:17,872 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-05-04 03:03:17,875 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-05-04 03:03:17,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-05-04 03:03:17,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 03:03:17,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-04 03:03:17,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 03:03:17,967 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-05-04 03:03:18,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-04 03:03:18,065 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-05-04 03:03:18,065 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-05-04 03:03:18,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-04 03:03:18,255 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-05-04 03:03:18,256 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-05-04 03:03:18,317 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-05-04 03:03:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-04 03:03:18,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 03:04:38,310 INFO L349 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2024-05-04 03:04:38,310 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 756 treesize of output 773 [2024-05-04 03:04:39,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,760 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,760 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-05-04 03:04:39,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,776 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,776 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-05-04 03:04:39,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,786 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,786 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-05-04 03:04:39,791 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,801 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,801 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 494 treesize of output 1 [2024-05-04 03:04:39,806 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,815 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,815 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-05-04 03:04:39,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,824 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,824 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-05-04 03:04:39,965 INFO L349 Elim1Store]: treesize reduction 1680, result has 0.1 percent of original size [2024-05-04 03:04:39,966 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 19564 treesize of output 1 [2024-05-04 03:04:39,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,979 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,979 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-05-04 03:04:39,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 03:04:39,988 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-05-04 03:04:39,988 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-05-04 03:04:40,124 INFO L349 Elim1Store]: treesize reduction 1680, result has 0.1 percent of original size [2024-05-04 03:04:40,125 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 20601 treesize of output 1 [2024-05-04 03:04:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 4 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-04 03:04:48,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994382341] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 03:04:48,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 03:04:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-05-04 03:04:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297918574] [2024-05-04 03:04:48,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 03:04:48,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-04 03:04:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:04:48,458 INFO L85 PathProgramCache]: Analyzing trace with hash 692199915, now seen corresponding path program 2 times [2024-05-04 03:04:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:04:48,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:04:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 03:04:48,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 03:04:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 03:04:48,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-04 03:04:48,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=524, Unknown=34, NotChecked=0, Total=702 [2024-05-04 03:04:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:04:48,474 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:04:48,474 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-05-04 03:04:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:04:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:04:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:04:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:04:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:04:48,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:04:48,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:04:48,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:04:48,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:04:48,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-04 03:04:48,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:04:51,184 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-05-04 03:04:53,187 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-05-04 03:04:55,298 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-05-04 03:04:57,300 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-05-04 03:04:59,311 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-05-04 03:05:02,081 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-05-04 03:05:04,130 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-05-04 03:05:06,177 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-05-04 03:05:08,183 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-05-04 03:05:10,241 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-05-04 03:05:13,360 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-05-04 03:05:15,433 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-05-04 03:05:17,437 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-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-04 03:05:23,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-04 03:05:23,164 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-05-04 03:05:23,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2024-05-04 03:05:23,360 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-05-04 03:05:23,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 03:05:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 468809223, now seen corresponding path program 3 times [2024-05-04 03:05:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 03:05:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703734972] [2024-05-04 03:05:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 03:05:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 03:05:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 03:05:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 03:05:23,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 03:05:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703734972] [2024-05-04 03:05:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703734972] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 03:05:23,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 03:05:23,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-04 03:05:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890283408] [2024-05-04 03:05:23,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 03:05:23,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-04 03:05:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 03:05:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 03:05:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-04 03:05:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:05:23,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 03:05:23,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-05-04 03:05:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:05:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-04 03:05:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 03:05:37,966 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-05-04 03:05:39,979 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-05-04 03:05:42,040 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-05-04 03:05:44,047 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-05-04 03:05:46,064 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-05-04 03:05:48,093 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-05-04 03:05:50,123 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-05-04 03:05:52,135 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-05-04 03:05:54,139 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-05-04 03:05:56,142 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-05-04 03:06:02,733 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-05-04 03:06:04,754 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-05-04 03:06:20,778 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-05-04 03:06:22,802 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-05-04 03:06:24,848 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-05-04 03:06:27,105 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-05-04 03:06:29,222 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-05-04 03:06:31,266 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-05-04 03:06:33,301 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-05-04 03:06:35,431 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-05-04 03:06:37,855 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-05-04 03:06:39,869 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-05-04 03:06:41,903 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-05-04 03:06:43,918 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-05-04 03:06:45,985 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-05-04 03:06:48,034 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-05-04 03:06:50,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-05-04 03:06:52,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:06:54,783 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-05-04 03:06:56,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:06:58,324 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-05-04 03:07:09,058 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-05-04 03:07:22,502 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-05-04 03:07:24,665 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-05-04 03:07:26,689 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-05-04 03:07:28,724 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-05-04 03:07:31,676 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-05-04 03:07:33,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:07:35,803 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-05-04 03:07:37,832 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 [0, 1] [2024-05-04 03:07:39,864 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (+ c_min 1)) (.cse0 (select c_A c_i)) (.cse3 (select c_A c_l)) (.cse4 (+ c_l 1))) (and (forall ((v_ArrVal_25 Int) (v_i_30 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_46 Int)) (let ((.cse6 (store c_A c_l v_ArrVal_25))) (let ((.cse5 (store .cse6 v_l_26 v_ArrVal_26))) (let ((.cse1 (select .cse6 v_i_46)) (.cse2 (select .cse5 v_i_30))) (or (< .cse0 .cse1) (< v_l_25 (+ v_l_26 1)) (< .cse1 .cse2) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< c_min .cse1) (< .cse2 (+ (select (store .cse5 v_l_25 v_ArrVal_27) 0) 2))))))) (forall ((v_i_40 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_26 Int)) (let ((.cse9 (store c_A c_l v_ArrVal_25))) (let ((.cse8 (store .cse9 v_l_26 v_ArrVal_26))) (let ((.cse7 (select .cse8 v_i_26))) (or (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< .cse7 (+ (select (store .cse8 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_26 .cse4) (< c_min .cse7) (< .cse0 .cse7) (< (select .cse9 v_i_40) .cse7)))))) (forall ((v_i_42 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_25 Int)) (let ((.cse12 (store c_A c_l v_ArrVal_25))) (let ((.cse10 (store .cse12 v_l_26 v_ArrVal_26))) (let ((.cse11 (+ (select (store .cse10 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse10 v_i_25) .cse11) (< .cse0 .cse11) (< (select .cse12 v_i_42) .cse11) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< c_min .cse11)))))) (forall ((v_ArrVal_25 Int) (v_i_41 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_29 Int)) (let ((.cse16 (store c_A c_l v_ArrVal_25))) (let ((.cse14 (store .cse16 v_l_26 v_ArrVal_26))) (let ((.cse15 (select (store .cse14 v_l_25 v_ArrVal_27) 0)) (.cse13 (select .cse16 v_i_41))) (or (< .cse0 .cse13) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< (select .cse14 v_i_29) (+ .cse15 3)) (< .cse13 (+ .cse15 2)) (< v_l_26 .cse4) (< c_min .cse13)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_i_43 Int) (v_l_25 Int) (v_subst_1 Int)) (let ((.cse18 (store c_A c_l v_ArrVal_25))) (let ((.cse20 (store .cse18 v_l_26 v_ArrVal_26))) (let ((.cse19 (select (store .cse20 v_l_25 v_ArrVal_27) 0))) (let ((.cse17 (+ .cse19 2))) (or (< .cse0 .cse17) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse18 v_i_43) (+ .cse19 3)) (< (select .cse20 v_subst_1) .cse17) (< c_min .cse17))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_44 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_28 Int)) (let ((.cse24 (store c_A c_l v_ArrVal_25))) (let ((.cse23 (store .cse24 v_l_26 v_ArrVal_26))) (let ((.cse21 (select .cse24 v_i_44)) (.cse22 (+ (select (store .cse23 v_l_25 v_ArrVal_27) 0) 2))) (or (< .cse21 .cse22) (< .cse0 .cse21) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< c_min .cse21) (< (select .cse23 v_i_28) .cse22)))))) (forall ((v_l_25 Int)) (or (< v_l_25 .cse4) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse25 (store c_A c_l v_ArrVal_26))) (let ((.cse26 (+ (select (store .cse25 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse25 i) .cse26) (< c_min .cse26))))))) (forall ((v_l_26 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((i Int)) (let ((.cse30 (store c_A c_l v_ArrVal_25))) (let ((.cse27 (select .cse30 i))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_29 Int)) (let ((.cse29 (store .cse30 v_l_26 v_ArrVal_26))) (let ((.cse28 (select (store .cse29 v_l_25 v_ArrVal_27) 0))) (or (< .cse27 (+ .cse28 2)) (< v_l_25 (+ v_l_26 1)) (< (select .cse29 v_i_29) (+ .cse28 3)))))) (< c_min .cse27))))) (< (+ v_ArrVal_25 1) .cse3))) (< v_l_26 .cse4))) (forall ((v_l_26 Int)) (or (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse33 (store c_A c_l v_ArrVal_25))) (or (< (+ v_ArrVal_25 1) .cse3) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_3 Int)) (let ((.cse32 (store .cse33 v_l_26 v_ArrVal_26))) (let ((.cse31 (select .cse32 v_subst_3))) (or (< .cse31 (+ (select (store .cse32 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_25 (+ v_l_26 1)) (< c_min .cse31))))) (< (select .cse33 i) .cse34)))) (< v_l_26 .cse4))) (forall ((v_l_26 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int) (v_i_27 Int)) (let ((.cse35 (store c_A c_l v_ArrVal_25))) (let ((.cse37 (store .cse35 v_l_26 v_ArrVal_26))) (let ((.cse38 (select (store .cse37 v_l_25 v_ArrVal_27) 0))) (let ((.cse36 (+ .cse38 2))) (or (< (select .cse35 i) .cse36) (< v_l_25 (+ v_l_26 1)) (< (select .cse37 v_i_27) (+ .cse38 3)) (< c_min .cse36))))))) (< (+ v_ArrVal_25 1) .cse3))) (< v_l_26 .cse4))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_45 Int) (v_subst_3 Int)) (let ((.cse41 (store c_A c_l v_ArrVal_25))) (let ((.cse40 (store .cse41 v_l_26 v_ArrVal_26))) (let ((.cse39 (select .cse40 v_subst_3))) (or (< .cse0 .cse39) (< .cse39 (+ (select (store .cse40 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< c_min .cse39) (< (select .cse41 v_i_45) (+ .cse39 1))))))) (forall ((v_l_26 Int)) (or (< v_l_26 .cse4) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse3) (forall ((i Int)) (let ((.cse45 (store c_A c_l v_ArrVal_25))) (let ((.cse42 (select .cse45 i))) (or (< c_min .cse42) (forall ((v_i_30 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int)) (let ((.cse44 (store .cse45 v_l_26 v_ArrVal_26))) (let ((.cse43 (select .cse44 v_i_30))) (or (< v_l_25 (+ v_l_26 1)) (< .cse42 .cse43) (< .cse43 (+ (select (store .cse44 v_l_25 v_ArrVal_27) 0) 2)))))))))))))) (or (and (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_subst_8 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_1 Int)) (let ((.cse46 (store c_A c_l v_ArrVal_25))) (let ((.cse48 (store .cse46 v_l_26 v_ArrVal_26))) (let ((.cse47 (select (store .cse48 v_l_25 v_ArrVal_27) 0))) (let ((.cse49 (+ .cse47 2))) (or (< v_l_25 (+ v_l_26 1)) (< (select .cse46 v_subst_8) (+ .cse47 3)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse48 v_subst_1) .cse49) (< c_min .cse49))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_subst_6 Int) (v_l_25 Int) (v_i_29 Int)) (let ((.cse53 (store c_A c_l v_ArrVal_25))) (let ((.cse52 (store .cse53 v_l_26 v_ArrVal_26))) (let ((.cse51 (select (store .cse52 v_l_25 v_ArrVal_27) 0)) (.cse50 (select .cse53 v_subst_6))) (or (< .cse50 (+ .cse51 2)) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< (select .cse52 v_i_29) (+ .cse51 3)) (< v_l_26 .cse4) (< c_min .cse50)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_4 Int) (v_i_28 Int)) (let ((.cse57 (store c_A c_l v_ArrVal_25))) (let ((.cse54 (store .cse57 v_l_26 v_ArrVal_26))) (let ((.cse55 (+ (select (store .cse54 v_l_25 v_ArrVal_27) 0) 2)) (.cse56 (select .cse57 v_subst_4))) (or (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse54 v_i_28) .cse55) (< .cse56 .cse55) (< c_min .cse56)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_3 Int) (v_subst_10 Int)) (let ((.cse60 (store c_A c_l v_ArrVal_25))) (let ((.cse59 (store .cse60 v_l_26 v_ArrVal_26))) (let ((.cse58 (select .cse59 v_subst_3))) (or (< .cse58 (+ (select (store .cse59 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse60 v_subst_10) (+ .cse58 1)) (< c_min .cse58)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_11 Int) (v_i_27 Int)) (let ((.cse61 (store c_A c_l v_ArrVal_25))) (let ((.cse63 (store .cse61 v_l_26 v_ArrVal_26))) (let ((.cse64 (select (store .cse63 v_l_25 v_ArrVal_27) 0))) (let ((.cse62 (+ .cse64 2))) (or (< (select .cse61 v_subst_11) .cse62) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse63 v_i_27) (+ .cse64 3)) (< c_min .cse62))))))) (forall ((v_subst_12 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_2 Int)) (let ((.cse66 (store c_A c_l v_ArrVal_25))) (let ((.cse68 (store .cse66 v_l_26 v_ArrVal_26))) (let ((.cse65 (select (store .cse68 v_l_25 v_ArrVal_27) 0))) (let ((.cse67 (+ .cse65 3))) (or (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< c_min (+ .cse65 2)) (< (select .cse66 v_subst_12) .cse67) (< (select .cse68 v_subst_2) .cse67))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_5 Int) (v_i_26 Int)) (let ((.cse69 (store c_A c_l v_ArrVal_25))) (let ((.cse71 (store .cse69 v_l_26 v_ArrVal_26))) (let ((.cse70 (select .cse71 v_i_26))) (or (< (select .cse69 v_subst_5) .cse70) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< .cse70 (+ (select (store .cse71 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_26 .cse4) (< c_min .cse70)))))) (forall ((v_ArrVal_25 Int) (v_subst_9 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_25 Int)) (let ((.cse74 (store c_A c_l v_ArrVal_25))) (let ((.cse72 (store .cse74 v_l_26 v_ArrVal_26))) (let ((.cse73 (+ (select (store .cse72 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse72 v_i_25) .cse73) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse74 v_subst_9) .cse73) (< c_min .cse73)))))) (forall ((v_ArrVal_25 Int) (v_i_30 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_subst_7 Int) (v_l_25 Int)) (let ((.cse78 (store c_A c_l v_ArrVal_25))) (let ((.cse77 (store .cse78 v_l_26 v_ArrVal_26))) (let ((.cse75 (select .cse78 v_subst_7)) (.cse76 (select .cse77 v_i_30))) (or (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< c_min .cse75) (< v_l_26 .cse4) (< .cse75 .cse76) (< .cse76 (+ (select (store .cse77 v_l_25 v_ArrVal_27) 0) 2)))))))) (< .cse0 .cse34)) (forall ((v_l_26 Int)) (or (< v_l_26 .cse4) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse81 (store c_A c_l v_ArrVal_25))) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_2 Int)) (let ((.cse80 (store .cse81 v_l_26 v_ArrVal_26))) (let ((.cse79 (select (store .cse80 v_l_25 v_ArrVal_27) 0))) (or (< v_l_25 (+ v_l_26 1)) (< c_min (+ .cse79 2)) (< (select .cse80 v_subst_2) (+ .cse79 3)))))) (< (+ v_ArrVal_25 1) .cse3) (< (select .cse81 i) .cse34)))))) (or (and (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_57 Int) (v_subst_2 Int)) (let ((.cse83 (store c_A c_l v_ArrVal_25))) (let ((.cse85 (store .cse83 v_l_26 v_ArrVal_26))) (let ((.cse82 (select (store .cse85 v_l_25 v_ArrVal_27) 0))) (let ((.cse84 (+ .cse82 3))) (or (< .cse0 (+ .cse82 2)) (< (select .cse83 v_i_57) .cse84) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse85 v_subst_2) .cse84))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_56 Int) (v_i_25 Int)) (let ((.cse88 (store c_A c_l v_ArrVal_25))) (let ((.cse86 (store .cse88 v_l_26 v_ArrVal_26))) (let ((.cse87 (+ (select (store .cse86 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse86 v_i_25) .cse87) (< .cse0 .cse87) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse88 v_i_56) .cse87)))))) (forall ((v_ArrVal_25 Int) (v_i_52 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_28 Int)) (let ((.cse92 (store c_A c_l v_ArrVal_25))) (let ((.cse91 (store .cse92 v_l_26 v_ArrVal_26))) (let ((.cse89 (select .cse92 v_i_52)) (.cse90 (+ (select (store .cse91 v_l_25 v_ArrVal_27) 0) 2))) (or (< .cse89 .cse90) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< .cse0 .cse89) (< v_l_26 .cse4) (< (select .cse91 v_i_28) .cse90)))))) (forall ((v_i_50 Int) (v_ArrVal_25 Int) (v_i_30 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int)) (let ((.cse96 (store c_A c_l v_ArrVal_25))) (let ((.cse95 (store .cse96 v_l_26 v_ArrVal_26))) (let ((.cse93 (select .cse96 v_i_50)) (.cse94 (select .cse95 v_i_30))) (or (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< .cse93 .cse94) (< v_l_26 .cse4) (< .cse0 .cse93) (< .cse94 (+ (select (store .cse95 v_l_25 v_ArrVal_27) 0) 2))))))) (forall ((v_i_51 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_29 Int)) (let ((.cse100 (store c_A c_l v_ArrVal_25))) (let ((.cse99 (store .cse100 v_l_26 v_ArrVal_26))) (let ((.cse97 (select .cse100 v_i_51)) (.cse98 (select (store .cse99 v_l_25 v_ArrVal_27) 0))) (or (< .cse0 .cse97) (< .cse97 (+ .cse98 2)) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< (select .cse99 v_i_29) (+ .cse98 3)) (< v_l_26 .cse4)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_i_54 Int) (v_l_25 Int) (v_i_26 Int)) (let ((.cse103 (store c_A c_l v_ArrVal_25))) (let ((.cse102 (store .cse103 v_l_26 v_ArrVal_26))) (let ((.cse101 (select .cse102 v_i_26))) (or (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< .cse101 (+ (select (store .cse102 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_26 .cse4) (< .cse0 .cse101) (< (select .cse103 v_i_54) .cse101)))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_27 Int) (v_i_49 Int)) (let ((.cse105 (store c_A c_l v_ArrVal_25))) (let ((.cse106 (store .cse105 v_l_26 v_ArrVal_26))) (let ((.cse107 (select (store .cse106 v_l_25 v_ArrVal_27) 0))) (let ((.cse104 (+ .cse107 2))) (or (< .cse0 .cse104) (< (select .cse105 v_i_49) .cse104) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse106 v_i_27) (+ .cse107 3)))))))) (forall ((v_i_53 Int) (v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_1 Int)) (let ((.cse110 (store c_A c_l v_ArrVal_25))) (let ((.cse109 (store .cse110 v_l_26 v_ArrVal_26))) (let ((.cse111 (select (store .cse109 v_l_25 v_ArrVal_27) 0))) (let ((.cse108 (+ .cse111 2))) (or (< .cse0 .cse108) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse109 v_subst_1) .cse108) (< (select .cse110 v_i_53) (+ .cse111 3)))))))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_i_55 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_3 Int)) (let ((.cse114 (store c_A c_l v_ArrVal_25))) (let ((.cse113 (store .cse114 v_l_26 v_ArrVal_26))) (let ((.cse112 (select .cse113 v_subst_3))) (or (< .cse0 .cse112) (< .cse112 (+ (select (store .cse113 v_l_25 v_ArrVal_27) 0) 2)) (< (select .cse114 v_i_55) (+ .cse112 1)) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4))))))) (< c_min .cse0)) (forall ((v_l_26 Int)) (or (< v_l_26 .cse4) (forall ((v_ArrVal_25 Int) (i Int)) (let ((.cse115 (store c_A c_l v_ArrVal_25))) (or (< (+ v_ArrVal_25 1) .cse3) (< (select .cse115 i) .cse34) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_subst_1 Int)) (let ((.cse116 (store .cse115 v_l_26 v_ArrVal_26))) (let ((.cse117 (+ (select (store .cse116 v_l_25 v_ArrVal_27) 0) 2))) (or (< v_l_25 (+ v_l_26 1)) (< (select .cse116 v_subst_1) .cse117) (< c_min .cse117)))))))))) (forall ((v_l_25 Int)) (or (< v_l_25 .cse4) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int)) (let ((.cse119 (store c_A c_l v_ArrVal_26))) (let ((.cse118 (select .cse119 i))) (or (< .cse118 (+ (select (store .cse119 v_l_25 v_ArrVal_27) 0) 2)) (< c_min .cse118))))))) (forall ((v_l_25 Int)) (or (forall ((v_ArrVal_26 Int)) (let ((.cse120 (store c_A c_l v_ArrVal_26))) (or (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store .cse120 v_l_25 v_ArrVal_27) 0) 2))) (forall ((i Int)) (<= (select .cse120 i) c_min))))) (< v_l_25 .cse4))) (forall ((v_l_26 Int)) (or (< v_l_26 .cse4) (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse3) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int) (v_i_25 Int)) (let ((.cse121 (store c_A c_l v_ArrVal_25))) (let ((.cse123 (store .cse121 v_l_26 v_ArrVal_26))) (let ((.cse122 (+ (select (store .cse123 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse121 i) .cse122) (< (select .cse123 v_i_25) .cse122) (< v_l_25 (+ v_l_26 1)) (< c_min .cse122)))))))))) (forall ((v_l_26 Int)) (or (forall ((v_ArrVal_25 Int)) (or (< (+ v_ArrVal_25 1) .cse3) (forall ((i Int)) (let ((.cse127 (store c_A c_l v_ArrVal_25))) (let ((.cse124 (select .cse127 i))) (or (< c_min .cse124) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_28 Int)) (let ((.cse126 (store .cse127 v_l_26 v_ArrVal_26))) (let ((.cse125 (+ (select (store .cse126 v_l_25 v_ArrVal_27) 0) 2))) (or (< .cse124 .cse125) (< v_l_25 (+ v_l_26 1)) (< (select .cse126 v_i_28) .cse125))))))))))) (< v_l_26 .cse4))) (< 0 .cse4) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_48 Int) (v_subst_2 Int)) (let ((.cse129 (store c_A c_l v_ArrVal_25))) (let ((.cse131 (store .cse129 v_l_26 v_ArrVal_26))) (let ((.cse132 (select (store .cse131 v_l_25 v_ArrVal_27) 0))) (let ((.cse128 (+ .cse132 2)) (.cse130 (+ .cse132 3))) (or (< .cse0 .cse128) (< v_l_25 (+ v_l_26 1)) (< (select .cse129 v_i_48) .cse130) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< c_min .cse128) (< (select .cse131 v_subst_2) .cse130))))))) (forall ((v_l_26 Int)) (or (forall ((v_ArrVal_25 Int)) (or (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int) (v_i_26 Int)) (let ((.cse135 (store c_A c_l v_ArrVal_25))) (let ((.cse134 (store .cse135 v_l_26 v_ArrVal_26))) (let ((.cse133 (select .cse134 v_i_26))) (or (< v_l_25 (+ v_l_26 1)) (< .cse133 (+ (select (store .cse134 v_l_25 v_ArrVal_27) 0) 2)) (< c_min .cse133) (< (select .cse135 i) .cse133)))))) (< (+ v_ArrVal_25 1) .cse3))) (< v_l_26 .cse4))) (forall ((v_ArrVal_25 Int) (v_ArrVal_26 Int) (v_l_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_47 Int) (v_i_27 Int)) (let ((.cse139 (store c_A c_l v_ArrVal_25))) (let ((.cse137 (store .cse139 v_l_26 v_ArrVal_26))) (let ((.cse138 (select (store .cse137 v_l_25 v_ArrVal_27) 0))) (let ((.cse136 (+ .cse138 2))) (or (< .cse0 .cse136) (< v_l_25 (+ v_l_26 1)) (< (+ v_ArrVal_25 1) .cse3) (< v_l_26 .cse4) (< (select .cse137 v_i_27) (+ .cse138 3)) (< c_min .cse136) (< (select .cse139 v_i_47) .cse136))))))))) is different from false [2024-05-04 03:08:32,904 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-05-04 03:08:34,913 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-05-04 03:08:36,922 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-05-04 03:08:38,938 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-05-04 03:08:40,943 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-05-04 03:08:42,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:08:44,149 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-05-04 03:08:46,161 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-05-04 03:08:48,172 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-05-04 03:08:50,179 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-05-04 03:09:12,890 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-05-04 03:09:14,899 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-05-04 03:09:16,940 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-05-04 03:09:18,962 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-05-04 03:09:21,006 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-05-04 03:09:23,011 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-05-04 03:09:25,015 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-05-04 03:09:27,036 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-05-04 03:09:29,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-05-04 03:10:15,876 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-05-04 03:10:17,921 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-05-04 03:10: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-05-04 03:10:21,966 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-05-04 03:10:24,016 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-05-04 03:10:26,036 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-05-04 03:10:28,051 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-05-04 03:10:30,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_l 1))) (and (forall ((i Int)) (let ((.cse0 (select c_A i))) (or (< c_min .cse0) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_28 Int)) (let ((.cse3 (store c_A c_l v_ArrVal_26))) (let ((.cse2 (+ (select (store .cse3 v_l_25 v_ArrVal_27) 0) 2))) (or (< v_l_25 .cse1) (< .cse0 .cse2) (< (select .cse3 v_i_28) .cse2)))))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int) (v_i_25 Int)) (let ((.cse4 (store c_A c_l v_ArrVal_26))) (let ((.cse5 (+ (select (store .cse4 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse4 v_i_25) .cse5) (< c_min .cse5) (< v_l_25 .cse1) (< (select c_A i) .cse5))))) (forall ((i Int)) (let ((.cse6 (select c_A i))) (or (< c_min .cse6) (forall ((v_i_30 Int) (v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int)) (let ((.cse8 (store c_A c_l v_ArrVal_26))) (let ((.cse7 (select .cse8 v_i_30))) (or (< .cse7 (+ (select (store .cse8 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_25 .cse1) (< .cse6 .cse7)))))))) (forall ((i Int)) (let ((.cse9 (select c_A i))) (or (< c_min .cse9) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (v_l_25 Int) (v_i_29 Int)) (let ((.cse10 (store c_A c_l v_ArrVal_26))) (let ((.cse11 (select (store .cse10 v_l_25 v_ArrVal_27) 0))) (or (< v_l_25 .cse1) (< (select .cse10 v_i_29) (+ .cse11 3)) (< .cse9 (+ .cse11 2))))))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int) (v_i_27 Int)) (let ((.cse13 (store c_A c_l v_ArrVal_26))) (let ((.cse14 (select (store .cse13 v_l_25 v_ArrVal_27) 0))) (let ((.cse12 (+ .cse14 2))) (or (< c_min .cse12) (< (select .cse13 v_i_27) (+ .cse14 3)) (< v_l_25 .cse1) (< (select c_A i) .cse12)))))) (forall ((v_ArrVal_27 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_27) 0) 2))) (or (and (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int)) (let ((.cse16 (store c_A c_l v_ArrVal_26))) (let ((.cse15 (select (store .cse16 v_l_25 v_ArrVal_27) 0))) (or (< c_min (+ .cse15 2)) (< (select .cse16 i) (+ .cse15 3)) (< v_l_25 .cse1))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int)) (let ((.cse18 (store c_A c_l v_ArrVal_26))) (let ((.cse17 (select .cse18 i))) (or (< .cse17 (+ (select (store .cse18 v_l_25 v_ArrVal_27) 0) 2)) (< v_l_25 .cse1) (< c_min .cse17))))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int)) (let ((.cse19 (store c_A c_l v_ArrVal_26))) (let ((.cse20 (+ (select (store .cse19 v_l_25 v_ArrVal_27) 0) 2))) (or (< (select .cse19 i) .cse20) (< c_min .cse20) (< v_l_25 .cse1)))))) (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_ArrVal_26 Int) (v_ArrVal_27 Int) (i Int) (v_l_25 Int) (v_i_26 Int)) (let ((.cse22 (store c_A c_l v_ArrVal_26))) (let ((.cse21 (select .cse22 v_i_26))) (or (< c_min .cse21) (< v_l_25 .cse1) (< (select c_A i) .cse21) (< .cse21 (+ (select (store .cse22 v_l_25 v_ArrVal_27) 0) 2)))))))) is different from false [2024-05-04 03:10:32,130 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-05-04 03:10:34,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:10:36,247 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-05-04 03:10:38,273 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-05-04 03:10:40,298 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-05-04 03:10:42,312 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-05-04 03:10:44,334 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-05-04 03:10:46,349 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-05-04 03:10:48,376 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-05-04 03:10:50,392 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-05-04 03:10:52,445 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-05-04 03:10:54,458 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-05-04 03:10:56,483 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-05-04 03:10:58,499 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-05-04 03:11:00,524 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-05-04 03:11:02,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:11:04,690 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-05-04 03:11:06,707 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-05-04 03:11:08,730 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-05-04 03:11:10,767 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-05-04 03:11:12,779 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-05-04 03:11:14,787 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-05-04 03:11:16,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-05-04 03:11:18,976 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-05-04 03:11:21,008 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-05-04 03:11:23,034 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-05-04 03:11:25,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:11:27,144 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-05-04 03:11:29,160 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-05-04 03:11:31,193 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-05-04 03:11:33,209 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-05-04 03:11:35,225 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-05-04 03:11:37,234 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-05-04 03:11:39,254 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-05-04 03:11:41,266 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-05-04 03:11:43,277 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-05-04 03:11:45,282 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-05-04 03:11:47,296 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-05-04 03:11:49,309 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-05-04 03:11:51,319 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-05-04 03:11:53,329 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-05-04 03:11:55,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-05-04 03:11:57,349 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-05-04 03:11:59,373 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-05-04 03:12:01,383 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-05-04 03:12:03,392 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-05-04 03:12:05,402 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-05-04 03:12:07,412 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-05-04 03:12:09,418 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-05-04 03:12:11,431 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-05-04 03:12:13,442 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-05-04 03:12:15,450 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-05-04 03:12:17,451 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-05-04 03:12:19,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-05-04 03:12:21,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:12:23,760 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-05-04 03:12:25,770 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-05-04 03:12:27,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-05-04 03:12:29,793 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-05-04 03:12:31,804 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-05-04 03:12:33,809 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-05-04 03:12:35,820 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-05-04 03:12:37,837 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-05-04 03:12:39,845 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-05-04 03:12:41,853 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-05-04 03:12:43,871 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-05-04 03:12:45,885 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-05-04 03:12:47,901 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-05-04 03:12:49,909 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-05-04 03:12:51,922 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-05-04 03:12:53,931 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-05-04 03:12:55,944 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-05-04 03:12:57,959 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-05-04 03:12:59,973 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-05-04 03:13:01,984 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-05-04 03:13:03,996 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-05-04 03:13:06,004 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-05-04 03:13:08,036 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-05-04 03:13:10,056 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-05-04 03:13:12,072 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-05-04 03:13:14,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-05-04 03:13:16,089 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-05-04 03:13:18,100 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-05-04 03:13:20,129 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-05-04 03:13:22,130 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-05-04 03:13:24,143 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-05-04 03:13:26,159 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-05-04 03:13:28,169 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-05-04 03:13:30,180 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-05-04 03:13:32,209 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-05-04 03:13:34,231 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-05-04 03:13:36,236 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-05-04 03:13:38,254 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-05-04 03:13:40,266 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-05-04 03:13:42,275 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-05-04 03:13:44,293 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-05-04 03:13:46,304 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-05-04 03:13:48,338 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-05-04 03:13:50,353 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-05-04 03:13:52,364 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-05-04 03:13:54,377 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-05-04 03:13:56,387 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-05-04 03:13:58,398 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-05-04 03:14:00,411 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-05-04 03:14:02,422 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-05-04 03:14:04,434 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-05-04 03:14:06,450 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-05-04 03:14:08,458 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-05-04 03:14:10,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-05-04 03:14:12,486 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-05-04 03:14:14,497 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-05-04 03:14:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-04 03:14:18,822 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-05-04 03:14:20,866 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-05-04 03:14:22,891 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-05-04 03:14:24,897 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-05-04 03:14:26,905 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-05-04 03:14:28,918 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-05-04 03:14:30,935 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-05-04 03:14:32,945 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-05-04 03:14:34,951 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-05-04 03:14:36,956 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-05-04 03:14:38,969 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-05-04 03:14:40,983 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-05-04 03:14:43,009 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-05-04 03:14:45,014 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-05-04 03:14:47,019 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-05-04 03:14:49,040 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-05-04 03:14:51,049 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-05-04 03:14:53,054 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-05-04 03:15:16,675 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-05-04 03:15:44,475 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-05-04 03:15:46,484 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-05-04 03:15:48,515 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-05-04 03:15:50,548 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-05-04 03:15:52,584 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-05-04 03:15:54,607 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-05-04 03:15:56,625 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-05-04 03:15:58,635 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-05-04 03:16:00,699 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-05-04 03:16:03,203 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-05-04 03:16:05,227 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-05-04 03:16:07,255 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-05-04 03:16:09,316 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 [0, 1] [2024-05-04 03:16:54,268 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-05-04 03:16:56,277 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-05-04 03:16:58,293 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-05-04 03:17:00,312 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-05-04 03:17:02,343 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-05-04 03:17:04,351 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-05-04 03:17:06,363 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-05-04 03:17:08,381 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-05-04 03:17:10,387 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-05-04 03:17:12,406 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-05-04 03:17:14,417 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-05-04 03:17:16,452 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-05-04 03:17:18,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-05-04 03:17:20,481 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-05-04 03:17:22,488 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-05-04 03:17:24,513 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-05-04 03:17:26,520 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-05-04 03:17:28,526 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-05-04 03:17:30,549 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-05-04 03:17:32,705 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-05-04 03:17:34,748 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-05-04 03:17:36,764 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-05-04 03:17:39,968 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-05-04 03:17:41,987 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-05-04 03:17:44,065 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] Received shutdown request... [2024-05-04 03:17:44,835 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 03:17:44,835 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 03:17:45,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-04 03:17:46,036 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-04 03:17:46,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-04 03:17:46,093 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-04 03:17:46,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2024-05-04 03:17:46,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-04 03:17:46,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-04 03:17:46,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-04 03:17:46,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-04 03:17:46,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-04 03:17:46,102 INFO L448 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1] [2024-05-04 03:17:46,106 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 03:17:46,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 03:17:46,110 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 03:17:46 BasicIcfg [2024-05-04 03:17:46,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 03:17:46,111 INFO L158 Benchmark]: Toolchain (without parser) took 878813.21ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 85.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 749.2MB. Max. memory is 8.0GB. [2024-05-04 03:17:46,111 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 155.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 03:17:46,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.54ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 125.9MB in the end (delta: -40.6MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2024-05-04 03:17:46,112 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 155.2MB. Free memory was 125.9MB in the beginning and 126.4MB in the end (delta: -453.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 03:17:46,112 INFO L158 Benchmark]: RCFGBuilder took 256.41ms. Allocated memory is still 155.2MB. Free memory was 126.2MB in the beginning and 115.3MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-04 03:17:46,112 INFO L158 Benchmark]: TraceAbstraction took 878458.02ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 114.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 777.8MB. Max. memory is 8.0GB. [2024-05-04 03:17:46,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 155.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.54ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 125.9MB in the end (delta: -40.6MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 155.2MB. Free memory was 125.9MB in the beginning and 126.4MB in the end (delta: -453.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 256.41ms. Allocated memory is still 155.2MB. Free memory was 126.2MB in the beginning and 115.3MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 878458.02ms. Allocated memory was 155.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 114.1MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 777.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2112621, independent: 1859183, independent conditional: 1859182, independent unconditional: 1, dependent: 253432, dependent conditional: 253432, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1898995, independent: 1859183, independent conditional: 1859182, independent unconditional: 1, dependent: 39806, dependent conditional: 39806, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1898995, independent: 1859183, independent conditional: 1859182, independent unconditional: 1, dependent: 39806, dependent conditional: 39806, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1898995, independent: 1859183, independent conditional: 1859182, independent unconditional: 1, dependent: 39806, dependent conditional: 39806, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2207337, independent: 1859183, independent conditional: 24012, independent unconditional: 1835171, dependent: 348148, dependent conditional: 245768, dependent unconditional: 102380, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2207337, independent: 1859183, independent conditional: 23590, independent unconditional: 1835593, dependent: 348148, dependent conditional: 206711, dependent unconditional: 141437, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2207337, independent: 1859183, independent conditional: 23590, independent unconditional: 1835593, dependent: 348148, dependent conditional: 206711, dependent unconditional: 141437, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 753, independent: 368, independent conditional: 108, independent unconditional: 260, dependent: 384, dependent conditional: 370, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 753, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 492, dependent conditional: 0, dependent unconditional: 492, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 492, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 384, dependent conditional: 370, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 492, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 384, dependent conditional: 370, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2321, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 1129, dependent conditional: 1070, dependent unconditional: 59, unknown: 1012, unknown conditional: 1012, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2207337, independent: 1858815, independent conditional: 23482, independent unconditional: 1835333, dependent: 347764, dependent conditional: 206341, dependent unconditional: 141423, unknown: 758, unknown conditional: 484, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 368, Positive conditional cache size: 108, Positive unconditional cache size: 260, Negative cache size: 384, Negative conditional cache size: 370, Negative unconditional cache size: 14, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 39479, Maximal queried relation: 12, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2207337, independent: 1859183, independent conditional: 24012, independent unconditional: 1835171, dependent: 348148, dependent conditional: 245768, dependent unconditional: 102380, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2207337, independent: 1859183, independent conditional: 23590, independent unconditional: 1835593, dependent: 348148, dependent conditional: 206711, dependent unconditional: 141437, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2207337, independent: 1859183, independent conditional: 23590, independent unconditional: 1835593, dependent: 348148, dependent conditional: 206711, dependent unconditional: 141437, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 753, independent: 368, independent conditional: 108, independent unconditional: 260, dependent: 384, dependent conditional: 370, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 753, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 492, dependent conditional: 0, dependent unconditional: 492, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 492, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 384, dependent conditional: 370, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 492, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 384, dependent conditional: 370, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2321, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 1129, dependent conditional: 1070, dependent unconditional: 59, unknown: 1012, unknown conditional: 1012, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2207337, independent: 1858815, independent conditional: 23482, independent unconditional: 1835333, dependent: 347764, dependent conditional: 206341, dependent unconditional: 141423, unknown: 758, unknown conditional: 484, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 368, Positive conditional cache size: 108, Positive unconditional cache size: 260, Negative cache size: 384, Negative conditional cache size: 370, Negative unconditional cache size: 14, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 39479 ], Independence queries for same thread: 213626 - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 56 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 878.3s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 783.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 92.3s InterpolantComputationTime, 513 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 660 ConstructedInterpolants, 28 QuantifiedInterpolants, 18640 SizeOfPredicates, 24 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 90/200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.5s, ConditionalCommutativityIAIntegrations: 1, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 2, ConditionalCommutativityTraceChecks: 2, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown