/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-a343466-m [2025-01-30 00:33:04,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-30 00:33:04,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-30 00:33:04,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-30 00:33:04,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-30 00:33:04,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-30 00:33:04,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-30 00:33:04,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-30 00:33:04,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-30 00:33:04,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-30 00:33:04,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-30 00:33:04,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-30 00:33:04,952 INFO L153 SettingsManager]: * Use SBE=true [2025-01-30 00:33:04,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-30 00:33:04,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-30 00:33:04,953 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-30 00:33:04,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-30 00:33:04,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-30 00:33:04,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:33:04,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-30 00:33:04,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-30 00:33:04,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-01-30 00:33:05,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-30 00:33:05,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-30 00:33:05,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-30 00:33:05,220 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-30 00:33:05,221 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-30 00:33:05,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl [2025-01-30 00:33:05,222 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl' [2025-01-30 00:33:05,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-30 00:33:05,240 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-30 00:33:05,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-30 00:33:05,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-30 00:33:05,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-30 00:33:05,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,261 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-30 00:33:05,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-30 00:33:05,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-30 00:33:05,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-30 00:33:05,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-30 00:33:05,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-30 00:33:05,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-30 00:33:05,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-30 00:33:05,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-30 00:33:05,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/1) ... [2025-01-30 00:33:05,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 00:33:05,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:33:05,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-30 00:33:05,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-30 00:33:05,342 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-30 00:33:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-30 00:33:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-30 00:33:05,343 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-30 00:33:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-30 00:33:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-30 00:33:05,343 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-30 00:33:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-30 00:33:05,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-30 00:33:05,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-30 00:33:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-30 00:33:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-30 00:33:05,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-01-30 00:33:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-30 00:33:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-30 00:33:05,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-01-30 00:33:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-30 00:33:05,344 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-30 00:33:05,345 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-30 00:33:05,386 INFO L234 CfgBuilder]: Building ICFG [2025-01-30 00:33:05,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-30 00:33:05,498 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-30 00:33:05,498 INFO L283 CfgBuilder]: Performing block encoding [2025-01-30 00:33:05,508 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-30 00:33:05,508 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-30 00:33:05,508 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:33:05 BoogieIcfgContainer [2025-01-30 00:33:05,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-30 00:33:05,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-30 00:33:05,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-30 00:33:05,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-30 00:33:05,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 12:33:05" (1/2) ... [2025-01-30 00:33:05,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9a0e40 and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:33:05, skipping insertion in model container [2025-01-30 00:33:05,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:33:05" (2/2) ... [2025-01-30 00:33:05,517 INFO L128 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2025-01-30 00:33:05,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-30 00:33:05,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG min-max-2.wvr.bpl that has 6 procedures, 43 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-30 00:33:05,533 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-30 00:33:05,598 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-30 00:33:05,639 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:33:05,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-30 00:33:05,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:33:05,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-30 00:33:05,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-30 00:33:05,707 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-30 00:33:05,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-30 00:33:05,735 INFO L333 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, 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;@67403b07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 00:33:05,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-30 00:33:06,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:06,400 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:06,401 INFO L139 ounterexampleChecker]: Examining path program with hash 1949790588, occurence #1 [2025-01-30 00:33:06,401 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:06,401 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2025-01-30 00:33:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647638232] [2025-01-30 00:33:06,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:33:06,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:33:06,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:06,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647638232] [2025-01-30 00:33:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647638232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:06,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:33:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585745558] [2025-01-30 00:33:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:33:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:06,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:33:06,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:33:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:06,809 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-01-30 00:33:06,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:07,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-30 00:33:07,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:07,949 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:07,950 INFO L139 ounterexampleChecker]: Examining path program with hash -1477873250, occurence #1 [2025-01-30 00:33:07,950 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:07,950 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:07,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2025-01-30 00:33:07,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:07,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981552597] [2025-01-30 00:33:07,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:07,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-30 00:33:07,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-30 00:33:07,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:07,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:08,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:08,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981552597] [2025-01-30 00:33:08,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981552597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:08,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:08,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:33:08,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350560913] [2025-01-30 00:33:08,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:08,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:33:08,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:08,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:33:08,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:33:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:08,083 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-30 00:33:08,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:08,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:08,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-30 00:33:08,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:08,572 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:08,572 INFO L139 ounterexampleChecker]: Examining path program with hash -775580297, occurence #1 [2025-01-30 00:33:08,572 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:08,572 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:08,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2025-01-30 00:33:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713674286] [2025-01-30 00:33:08,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:08,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:08,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-30 00:33:08,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-30 00:33:08,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:08,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:08,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:08,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713674286] [2025-01-30 00:33:08,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713674286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:08,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:08,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:33:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833238981] [2025-01-30 00:33:08,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:08,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:33:08,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:08,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:33:08,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:33:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:08,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:08,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) [2025-01-30 00:33:08,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:08,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:08,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-30 00:33:09,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:09,077 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:09,077 INFO L139 ounterexampleChecker]: Examining path program with hash 2114118821, occurence #1 [2025-01-30 00:33:09,077 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:09,078 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2025-01-30 00:33:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527010212] [2025-01-30 00:33:09,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:09,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-30 00:33:09,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-30 00:33:09,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527010212] [2025-01-30 00:33:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527010212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:09,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:33:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047444485] [2025-01-30 00:33:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:09,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:33:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:09,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:33:09,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:33:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:09,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:09,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) [2025-01-30 00:33:09,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:09,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-30 00:33:09,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:09,509 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:09,510 INFO L139 ounterexampleChecker]: Examining path program with hash -1491587652, occurence #1 [2025-01-30 00:33:09,510 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:09,510 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:09,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2025-01-30 00:33:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414920888] [2025-01-30 00:33:09,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-30 00:33:09,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-30 00:33:09,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:09,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414920888] [2025-01-30 00:33:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414920888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-30 00:33:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779891390] [2025-01-30 00:33:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:09,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 00:33:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:09,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 00:33:09,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-30 00:33:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:09,588 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:09,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-30 00:33:09,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:09,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:09,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-30 00:33:09,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:09,929 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:09,929 INFO L139 ounterexampleChecker]: Examining path program with hash -1956356865, occurence #1 [2025-01-30 00:33:09,929 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:09,929 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:09,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2025-01-30 00:33:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650793132] [2025-01-30 00:33:09,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:09,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-30 00:33:09,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 00:33:09,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:09,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650793132] [2025-01-30 00:33:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650793132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:33:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496161965] [2025-01-30 00:33:10,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:10,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:33:10,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:33:10,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:33:10,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-30 00:33:10,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-30 00:33:10,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 00:33:10,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:10,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-30 00:33:10,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:33:10,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:33:10,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-01-30 00:33:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:10,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:33:11,831 INFO L349 Elim1Store]: treesize reduction 5, result has 97.8 percent of original size [2025-01-30 00:33:11,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 319 [2025-01-30 00:33:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496161965] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-30 00:33:12,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-30 00:33:12,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-01-30 00:33:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304228524] [2025-01-30 00:33:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:12,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-30 00:33:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:12,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-30 00:33:12,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-30 00:33:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:12,211 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:12,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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) [2025-01-30 00:33:12,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:12,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:12,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:12,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:12,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:12,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:13,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:13,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:13,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-30 00:33:13,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-30 00:33:13,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:13,832 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:13,832 INFO L139 ounterexampleChecker]: Examining path program with hash -2138044988, occurence #1 [2025-01-30 00:33:13,832 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:13,832 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:13,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 456365027, now seen corresponding path program 2 times [2025-01-30 00:33:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629684524] [2025-01-30 00:33:13,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:33:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:13,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-30 00:33:13,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 00:33:13,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:33:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629684524] [2025-01-30 00:33:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629684524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:14,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:14,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-30 00:33:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557779889] [2025-01-30 00:33:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:14,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-30 00:33:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:14,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-30 00:33:14,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-30 00:33:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:14,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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) [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 00:33:14,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:18,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-30 00:33:18,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:18,501 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:18,501 INFO L139 ounterexampleChecker]: Examining path program with hash 806795213, occurence #1 [2025-01-30 00:33:18,501 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:18,501 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:18,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash 858758413, now seen corresponding path program 2 times [2025-01-30 00:33:18,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:18,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954050056] [2025-01-30 00:33:18,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:33:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:18,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-30 00:33:18,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-30 00:33:18,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:33:18,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954050056] [2025-01-30 00:33:18,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954050056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:18,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:18,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:33:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288252184] [2025-01-30 00:33:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:18,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:33:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:18,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:33:18,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:33:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:18,537 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:18,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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) [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:18,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-30 00:33:20,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:20,015 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:20,015 INFO L139 ounterexampleChecker]: Examining path program with hash -1064666699, occurence #1 [2025-01-30 00:33:20,015 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:20,015 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:20,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1077796018, now seen corresponding path program 1 times [2025-01-30 00:33:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680288867] [2025-01-30 00:33:20,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:20,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-30 00:33:20,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-30 00:33:20,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:20,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680288867] [2025-01-30 00:33:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680288867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:20,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:20,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:33:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536517730] [2025-01-30 00:33:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:33:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:20,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:33:20,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:33:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:20,044 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:20,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:20,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-30 00:33:21,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:21,329 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:21,330 INFO L139 ounterexampleChecker]: Examining path program with hash -1214774164, occurence #1 [2025-01-30 00:33:21,330 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:21,330 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:21,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1651596247, now seen corresponding path program 1 times [2025-01-30 00:33:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:21,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100384608] [2025-01-30 00:33:21,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 00:33:21,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:21,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-30 00:33:21,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-30 00:33:21,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:21,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100384608] [2025-01-30 00:33:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100384608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:21,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:21,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-30 00:33:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46598898] [2025-01-30 00:33:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-30 00:33:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:21,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-30 00:33:21,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-30 00:33:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:21,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:21,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-01-30 00:33:21,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:21,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:21,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:21,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:21,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-30 00:33:22,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:22,476 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:22,476 INFO L139 ounterexampleChecker]: Examining path program with hash -2109476048, occurence #1 [2025-01-30 00:33:22,476 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:22,476 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1573363713, now seen corresponding path program 3 times [2025-01-30 00:33:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145071191] [2025-01-30 00:33:22,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 00:33:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:22,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-30 00:33:22,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 00:33:22,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-30 00:33:22,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:22,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145071191] [2025-01-30 00:33:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145071191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-30 00:33:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431927033] [2025-01-30 00:33:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:22,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-30 00:33:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:22,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-30 00:33:22,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-30 00:33:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:22,646 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:22,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 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) [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:22,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:25,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-30 00:33:25,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:25,134 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:25,134 INFO L139 ounterexampleChecker]: Examining path program with hash -419242554, occurence #1 [2025-01-30 00:33:25,134 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:25,134 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1373041165, now seen corresponding path program 4 times [2025-01-30 00:33:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911493440] [2025-01-30 00:33:25,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-30 00:33:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:25,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-30 00:33:25,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-30 00:33:25,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-30 00:33:25,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-30 00:33:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911493440] [2025-01-30 00:33:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911493440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:25,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-30 00:33:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955518307] [2025-01-30 00:33:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:25,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-30 00:33:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:25,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-30 00:33:25,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-30 00:33:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:25,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 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) [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:25,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:25,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:25,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:29,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-30 00:33:29,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:29,458 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:29,458 INFO L139 ounterexampleChecker]: Examining path program with hash -1306454522, occurence #1 [2025-01-30 00:33:29,458 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:29,458 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:29,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2099486894, now seen corresponding path program 5 times [2025-01-30 00:33:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:29,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851568858] [2025-01-30 00:33:29,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-30 00:33:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:29,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 1 equivalence classes. [2025-01-30 00:33:29,467 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-30 00:33:29,467 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 00:33:29,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851568858] [2025-01-30 00:33:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851568858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:33:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072903142] [2025-01-30 00:33:29,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:29,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-30 00:33:29,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:29,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-30 00:33:29,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-30 00:33:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:29,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:29,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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) [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:29,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:34,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-30 00:33:34,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:34,351 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:34,351 INFO L139 ounterexampleChecker]: Examining path program with hash -105051357, occurence #1 [2025-01-30 00:33:34,351 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:34,351 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1918103178, now seen corresponding path program 6 times [2025-01-30 00:33:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727413988] [2025-01-30 00:33:34,352 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-30 00:33:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:34,356 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 1 equivalence classes. [2025-01-30 00:33:34,364 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-30 00:33:34,364 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-30 00:33:34,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727413988] [2025-01-30 00:33:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727413988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 00:33:34,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 00:33:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 00:33:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199909189] [2025-01-30 00:33:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 00:33:34,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-30 00:33:34,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:34,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-30 00:33:34,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-30 00:33:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:34,425 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:34,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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) [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:34,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-30 00:33:42,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:42,302 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:42,302 INFO L139 ounterexampleChecker]: Examining path program with hash -1429687229, occurence #1 [2025-01-30 00:33:42,303 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 00:33:42,303 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:42,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1881806078, now seen corresponding path program 7 times [2025-01-30 00:33:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:42,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12848832] [2025-01-30 00:33:42,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 00:33:42,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:42,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-30 00:33:42,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-30 00:33:42,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:42,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12848832] [2025-01-30 00:33:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12848832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:33:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825589761] [2025-01-30 00:33:42,363 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-30 00:33:42,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:33:42,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:33:42,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:33:42,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-30 00:33:42,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-30 00:33:42,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-30 00:33:42,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 00:33:42,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:42,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-30 00:33:42,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:33:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:42,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:33:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 00:33:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825589761] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:33:42,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 00:33:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-30 00:33:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116448733] [2025-01-30 00:33:42,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 00:33:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-30 00:33:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:33:42,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-30 00:33:42,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-30 00:33:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:42,538 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:33:42,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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) [2025-01-30 00:33:42,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:42,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:33:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:33:56,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-30 00:33:56,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:33:56,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-30 00:33:56,982 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 00:33:56,982 INFO L139 ounterexampleChecker]: Examining path program with hash -1429687229, occurence #2 [2025-01-30 00:33:56,982 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-30 00:33:56,982 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-01-30 00:33:56,983 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:33:56,983 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-01-30 00:33:56,983 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:33:56,983 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 42 [2025-01-30 00:33:56,983 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-30 00:33:56,983 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-01-30 00:33:56,983 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-30 00:33:56,983 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-30 00:33:56,983 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 00:33:56,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 00:33:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash -985234385, now seen corresponding path program 8 times [2025-01-30 00:33:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 00:33:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534370086] [2025-01-30 00:33:56,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:33:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 00:33:56,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-30 00:33:57,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-30 00:33:57,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:33:57,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-30 00:33:57,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 00:33:57,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534370086] [2025-01-30 00:33:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534370086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 00:33:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184823560] [2025-01-30 00:33:57,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 00:33:57,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:33:57,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 00:33:57,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 00:33:57,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-30 00:33:57,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-30 00:33:57,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-30 00:33:57,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 00:33:57,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 00:33:57,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-30 00:33:57,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 00:33:57,457 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 [2025-01-30 00:33:57,490 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 25 treesize of output 13 [2025-01-30 00:33:57,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-30 00:33:57,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-30 00:33:57,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-30 00:33:57,611 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 [2025-01-30 00:33:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-30 00:33:57,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 00:34:01,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_l 1))) (and (or (forall ((i Int)) (<= (select c_A i) c_min)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) .cse0 v_ArrVal_39) 0) 2)))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse1 (+ (select (store (store c_A c_k v_ArrVal_38) .cse0 v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse1) (< c_min .cse1)))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse2 (select c_A i))) (or (< c_min .cse2) (< .cse2 (+ (select (store (store c_A c_k v_ArrVal_38) .cse0 v_ArrVal_39) 0) 2))))))) is different from false [2025-01-30 00:34:22,832 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (select c_A c_k) 1)) (.cse5 (+ c_k 1)) (.cse4 (select c_A c_i)) (.cse2 (+ c_l 1))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_15 Int)) (let ((.cse6 (store c_A c_k v_ArrVal_36))) (let ((.cse1 (store .cse6 c_l v_ArrVal_37))) (let ((.cse0 (select .cse1 v_i_15))) (or (< .cse0 (+ 2 (select (store (store .cse1 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< c_min .cse0) (< v_ArrVal_36 .cse3) (< .cse4 .cse0) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse6 c_l))))))) (or (and (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_17 Int)) (let ((.cse9 (store c_A c_k v_ArrVal_36))) (let ((.cse7 (store .cse9 c_l v_ArrVal_37))) (let ((.cse8 (select (store (store .cse7 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (or (< (select .cse7 v_i_17) (+ 3 .cse8)) (< v_ArrVal_36 .cse3) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse9 c_l)) (< .cse4 (+ 2 .cse8))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_16 Int)) (let ((.cse12 (store c_A c_k v_ArrVal_36))) (let ((.cse10 (store .cse12 c_l v_ArrVal_37))) (let ((.cse11 (+ 2 (select (store (store .cse10 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< (select .cse10 v_i_16) .cse11) (< v_ArrVal_36 .cse3) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse12 c_l)) (< .cse4 .cse11)))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_18 Int)) (let ((.cse15 (store c_A c_k v_ArrVal_36))) (let ((.cse14 (store .cse15 c_l v_ArrVal_37))) (let ((.cse13 (select .cse14 v_i_18))) (or (< v_ArrVal_36 .cse3) (< .cse4 .cse13) (< v_k_12 .cse5) (< .cse13 (+ 2 (select (store (store .cse14 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< (+ v_ArrVal_37 1) (select .cse15 c_l)))))))) (< c_min .cse4)) (or (and (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (i Int) (v_k_12 Int)) (let ((.cse17 (store c_A c_k v_ArrVal_36))) (let ((.cse18 (store .cse17 c_l v_ArrVal_37))) (let ((.cse16 (+ 2 (select (store (store .cse18 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< v_ArrVal_36 .cse3) (< c_min .cse16) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse17 c_l)) (< (select .cse18 i) .cse16)))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (i Int) (v_k_12 Int)) (let ((.cse21 (store c_A c_k v_ArrVal_36))) (let ((.cse20 (store .cse21 c_l v_ArrVal_37))) (let ((.cse19 (select (store (store .cse20 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (or (< v_ArrVal_36 .cse3) (< c_min (+ 2 .cse19)) (< (select .cse20 i) (+ 3 .cse19)) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse21 c_l))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (i Int) (v_k_12 Int)) (let ((.cse22 (store c_A c_k v_ArrVal_36))) (let ((.cse24 (store .cse22 c_l v_ArrVal_37))) (let ((.cse23 (select .cse24 i))) (or (< v_ArrVal_36 .cse3) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse22 c_l)) (< c_min .cse23) (< .cse23 (+ 2 (select (store (store .cse24 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))))))))) (< .cse4 (+ c_min 1))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_13 Int)) (let ((.cse28 (store c_A c_k v_ArrVal_36))) (let ((.cse25 (store .cse28 c_l v_ArrVal_37))) (let ((.cse26 (select (store (store .cse25 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (let ((.cse27 (+ 2 .cse26))) (or (< v_ArrVal_36 .cse3) (< (select .cse25 v_i_13) (+ 3 .cse26)) (< c_min .cse27) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse28 c_l)) (< .cse4 .cse27))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_36 Int) (v_ArrVal_37 Int) (v_ArrVal_38 Int) (v_k_12 Int) (v_i_14 Int)) (let ((.cse31 (store c_A c_k v_ArrVal_36))) (let ((.cse29 (store .cse31 c_l v_ArrVal_37))) (let ((.cse30 (+ 2 (select (store (store .cse29 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< v_ArrVal_36 .cse3) (< (select .cse29 v_i_14) .cse30) (< c_min .cse30) (< v_k_12 .cse5) (< (+ v_ArrVal_37 1) (select .cse31 c_l)) (< .cse4 .cse30)))))))) is different from false [2025-01-30 00:34:24,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-30 00:34:24,146 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 32560 treesize of output 31336 [2025-01-30 00:34:27,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:34:27,002 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:34:27,017 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-30 00:34:27,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1124 treesize of output 1 [2025-01-30 00:34:27,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:34:27,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:34:27,041 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-30 00:34:27,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1124 treesize of output 1 [2025-01-30 00:34:27,048 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:34:27,086 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-01-30 00:34:27,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 4727 treesize of output 1 [2025-01-30 00:34:27,094 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-30 00:34:27,131 INFO L349 Elim1Store]: treesize reduction 168, result has 0.6 percent of original size [2025-01-30 00:34:27,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 6865 treesize of output 1 [2025-01-30 00:34:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2025-01-30 00:34:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184823560] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 00:34:31,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 00:34:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2025-01-30 00:34:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525345443] [2025-01-30 00:34:31,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 00:34:31,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-30 00:34:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 00:34:31,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-30 00:34:31,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=562, Unknown=13, NotChecked=102, Total=812 [2025-01-30 00:34:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:34:31,171 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 00:34:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 28 states have internal predecessors, (98), 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) [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 00:34:31,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 00:34:38,187 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] [2025-01-30 00:34:40,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 [1] [2025-01-30 00:34:50,329 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] [2025-01-30 00:34:52,333 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] [2025-01-30 00:34:56,109 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] [2025-01-30 00:35:02,030 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] [2025-01-30 00:35:04,034 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] [2025-01-30 00:35:06,194 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] [2025-01-30 00:35:08,198 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] [2025-01-30 00:35:10,202 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] [2025-01-30 00:35:12,206 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] [2025-01-30 00:35:14,265 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] [2025-01-30 00:35:16,289 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] [2025-01-30 00:35:18,302 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] [2025-01-30 00:35:20,308 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] [2025-01-30 00:35:29,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2)))) (.cse2 (select c_A c_l)) (.cse8 (+ (select c_A c_k) 1)) (.cse1 (+ c_l 1)) (.cse5 (+ c_k 1))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse0 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse0) (< c_min .cse0)))) c_v_assert (not (= .cse1 0)) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse2) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse4 (store c_A c_l v_ArrVal_37))) (let ((.cse3 (+ 2 (select (store (store .cse4 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (or (< c_min .cse3) (< (select .cse4 i) .cse3))))))) (< v_k_12 .cse5))) (<= c_min c_max) (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse7 (store c_A c_l v_ArrVal_37))) (let ((.cse6 (+ 2 (select (store (store .cse7 c_k v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (or (< c_min .cse6) (< (select .cse7 i) .cse6))))) (< (+ v_ArrVal_37 1) .cse2))) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse8) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse11 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse10 (store .cse11 c_l v_ArrVal_37))) (let ((.cse9 (select .cse10 i))) (or (< c_min .cse9) (< .cse9 (+ 2 (select (store (store .cse10 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0))))))) (< (+ v_ArrVal_37 1) (select .cse11 c_l))))) (< v_k_12 .cse5))))) (forall ((v_ArrVal_37 Int)) (let ((.cse12 (store c_A c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse12 i) c_min)) (< (+ v_ArrVal_37 1) .cse2) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse12 c_k v_ArrVal_38) .cse1 v_ArrVal_39) 0))))))) .cse13 (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse15 (store c_A c_l v_ArrVal_37))) (let ((.cse14 (select .cse15 i))) (or (< .cse14 (+ 2 (select (store (store .cse15 c_k v_ArrVal_38) .cse1 v_ArrVal_39) 0))) (< c_min .cse14))))) (< (+ v_ArrVal_37 1) .cse2))) (forall ((v_k_12 Int)) (or (< v_k_12 .cse5) (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse2) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse17 (store c_A c_l v_ArrVal_37))) (let ((.cse16 (select .cse17 i))) (or (< .cse16 (+ 2 (select (store (store .cse17 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0))) (< c_min .cse16))))))))) (forall ((v_ArrVal_36 Int)) (or (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse19 (store c_A c_k v_ArrVal_36))) (let ((.cse18 (store .cse19 c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse18 i) c_min)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse18 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (< (+ v_ArrVal_37 1) (select .cse19 c_l)))))) (< v_k_12 .cse5))) (< v_ArrVal_36 .cse8))) (or .cse13 (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse20 (store c_A c_l v_ArrVal_37))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse20 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (forall ((i Int)) (<= (select .cse20 i) c_min)) (< (+ v_ArrVal_37 1) .cse2)))) (< v_k_12 .cse5))) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse8) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse23 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse22 (store .cse23 c_l v_ArrVal_37))) (let ((.cse21 (+ 2 (select (store (store .cse22 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (or (< c_min .cse21) (< (select .cse22 i) .cse21))))) (< (+ v_ArrVal_37 1) (select .cse23 c_l))))) (< v_k_12 .cse5))))) (<= 0 c_k) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse24 (select c_A i))) (or (< c_min .cse24) (< .cse24 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))))) is different from false [2025-01-30 00:35:54,025 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] [2025-01-30 00:35:56,043 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] [2025-01-30 00:35:58,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_l 1)) (.cse3 (select c_A c_l))) (and (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse1 (store c_A c_l v_ArrVal_37))) (let ((.cse0 (+ 2 (select (store (store .cse1 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< c_min .cse0) (< (select .cse1 i) .cse0))))) (< (+ v_ArrVal_37 1) .cse3))) (forall ((v_ArrVal_37 Int)) (let ((.cse4 (store c_A c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse4 i) c_min)) (< (+ v_ArrVal_37 1) .cse3) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse4 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0))))))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (forall ((v_ArrVal_37 Int)) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse6 (store c_A c_l v_ArrVal_37))) (let ((.cse5 (select .cse6 i))) (or (< .cse5 (+ 2 (select (store (store .cse6 c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< c_min .cse5))))) (< (+ v_ArrVal_37 1) .cse3))))) is different from false [2025-01-30 00:36:00,274 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] [2025-01-30 00:36:02,861 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] [2025-01-30 00:36:04,871 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] [2025-01-30 00:36:07,025 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] [2025-01-30 00:36:27,850 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] [2025-01-30 00:36:30,078 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] [2025-01-30 00:36:32,111 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] [2025-01-30 00:36:34,128 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] [2025-01-30 00:36:36,134 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] [2025-01-30 00:36:38,159 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] [2025-01-30 00:36:40,181 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] [2025-01-30 00:36:42,205 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] [2025-01-30 00:36:52,365 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] [2025-01-30 00:36:54,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:36:56,657 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] [2025-01-30 00:36:58,678 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] [2025-01-30 00:37:08,935 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] [2025-01-30 00:37:10,967 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] [2025-01-30 00:37:12,188 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] [2025-01-30 00:37:26,383 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] [2025-01-30 00:37:28,460 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] [2025-01-30 00:37:30,506 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] [2025-01-30 00:37:32,544 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] [2025-01-30 00:37:34,608 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] [2025-01-30 00:37:36,634 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] [2025-01-30 00:37:38,684 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] [2025-01-30 00:37:40,724 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] [2025-01-30 00:37:42,772 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] [2025-01-30 00:37:44,795 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] [2025-01-30 00:37:46,812 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] [2025-01-30 00:37:48,835 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] [2025-01-30 00:37:50,846 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] [2025-01-30 00:37:52,859 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] [2025-01-30 00:37:54,902 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] [2025-01-30 00:37:56,936 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] [2025-01-30 00:37:58,978 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] [2025-01-30 00:38:00,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:38:03,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] [2025-01-30 00:38:05,071 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] [2025-01-30 00:38:07,100 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] [2025-01-30 00:38:09,135 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] [2025-01-30 00:38:11,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse0 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse0) (< c_min .cse0)))) .cse1 (or .cse1 (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse2 (select c_A i))) (or (< c_min .cse2) (< .cse2 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))))) is different from false [2025-01-30 00:38:13,409 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] [2025-01-30 00:38:15,468 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] [2025-01-30 00:38:17,487 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] [2025-01-30 00:38:19,573 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] [2025-01-30 00:38:21,595 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] [2025-01-30 00:38:23,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:38:25,630 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] [2025-01-30 00:38:27,652 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] [2025-01-30 00:38:29,691 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] [2025-01-30 00:38:31,720 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] [2025-01-30 00:38:33,749 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] [2025-01-30 00:38:35,769 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] [2025-01-30 00:38:37,793 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] [2025-01-30 00:38:39,825 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] [2025-01-30 00:38:41,850 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] [2025-01-30 00:38:43,989 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] [2025-01-30 00:38:46,000 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] [2025-01-30 00:38:48,046 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] [2025-01-30 00:38:50,096 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] [2025-01-30 00:38:52,109 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] [2025-01-30 00:38:54,168 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] [2025-01-30 00:38:56,187 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] [2025-01-30 00:38:58,859 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] [2025-01-30 00:39:01,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:39:03,259 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] [2025-01-30 00:39:05,619 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] [2025-01-30 00:39:07,652 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] [2025-01-30 00:39:09,670 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] [2025-01-30 00:39:11,688 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] [2025-01-30 00:39:13,721 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] [2025-01-30 00:39:16,007 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] [2025-01-30 00:39:18,021 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] [2025-01-30 00:39:20,069 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] [2025-01-30 00:39:22,086 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] [2025-01-30 00:39:24,097 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] [2025-01-30 00:39:26,110 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] [2025-01-30 00:39:28,212 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] [2025-01-30 00:39:30,288 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] [2025-01-30 00:39:32,315 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] [2025-01-30 00:39:34,348 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] [2025-01-30 00:39:36,378 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] [2025-01-30 00:39:38,400 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] [2025-01-30 00:39:40,566 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] [2025-01-30 00:39:42,598 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] [2025-01-30 00:39:44,607 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] [2025-01-30 00:39:46,636 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] [2025-01-30 00:39:48,695 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] [2025-01-30 00:39:50,713 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] [2025-01-30 00:39:52,899 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] [2025-01-30 00:39:54,921 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] [2025-01-30 00:39:58,330 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] [2025-01-30 00:40:00,357 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] [2025-01-30 00:40:03,487 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] [2025-01-30 00:40:05,506 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] [2025-01-30 00:40:07,528 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] [2025-01-30 00:40:09,592 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] [2025-01-30 00:40:12,248 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] [2025-01-30 00:40:25,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 [1] [2025-01-30 00:40:27,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:40:29,239 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] [2025-01-30 00:40:31,348 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] [2025-01-30 00:40:33,395 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] [2025-01-30 00:40:35,738 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] [2025-01-30 00:40:37,811 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] [2025-01-30 00:40:40,368 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] [2025-01-30 00:40:42,513 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] [2025-01-30 00:40:44,527 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] [2025-01-30 00:40:46,543 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] [2025-01-30 00:40:48,579 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] [2025-01-30 00:40:50,643 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] [2025-01-30 00:40:52,653 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] [2025-01-30 00:40:54,668 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] [2025-01-30 00:40:56,670 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] [2025-01-30 00:40:58,672 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] [2025-01-30 00:41:20,924 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] [2025-01-30 00:41:22,928 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] [2025-01-30 00:41:24,938 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] [2025-01-30 00:41:26,946 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] [2025-01-30 00:41:28,947 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] [2025-01-30 00:41:30,949 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] [2025-01-30 00:41:32,954 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] [2025-01-30 00:41:34,959 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] [2025-01-30 00:41:36,969 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] [2025-01-30 00:41:38,970 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] [2025-01-30 00:41:40,989 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] [2025-01-30 00:41:43,022 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] [2025-01-30 00:41:45,037 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] [2025-01-30 00:41:47,075 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] [2025-01-30 00:41:50,204 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] [2025-01-30 00:41:52,332 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] [2025-01-30 00:41:54,353 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] [2025-01-30 00:41:56,371 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] [2025-01-30 00:41:58,390 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] [2025-01-30 00:42:00,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 [1] [2025-01-30 00:42:02,407 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] [2025-01-30 00:42:04,479 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] [2025-01-30 00:42:06,954 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] [2025-01-30 00:42:09,843 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] [2025-01-30 00:42:11,884 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] [2025-01-30 00:42:13,897 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] [2025-01-30 00:42:16,160 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] [2025-01-30 00:42:19,307 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] [2025-01-30 00:42:21,317 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] [2025-01-30 00:42:23,334 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] [2025-01-30 00:42:25,357 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] [2025-01-30 00:42:27,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:42:29,402 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] [2025-01-30 00:42:31,415 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] [2025-01-30 00:42:49,020 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] [2025-01-30 00:42:51,065 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] [2025-01-30 00:42:59,191 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] [2025-01-30 00:43:01,193 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] [2025-01-30 00:43:10,684 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] [2025-01-30 00:43:12,686 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] [2025-01-30 00:43:14,976 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] [2025-01-30 00:43:17,020 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] [2025-01-30 00:43:38,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] [2025-01-30 00:43:51,613 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] [2025-01-30 00:43:53,959 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] [2025-01-30 00:44:08,229 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] [2025-01-30 00:44:10,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:44:12,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:44:14,385 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] [2025-01-30 00:44:16,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2)))) (.cse1 (forall ((i Int)) (<= (select c_A i) c_min))) (.cse2 (+ c_l 1)) (.cse5 (select c_A c_l)) (.cse8 (+ c_k 1))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse0 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse0) (< c_min .cse0)))) (or .cse1 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0) 2)))) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse3 (+ (select (store (store c_A c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse3) (< c_min .cse3)))) (not (= .cse2 0)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse4 (select c_A i))) (or (< c_min .cse4) (< .cse4 (+ (select (store (store c_A c_k v_ArrVal_38) .cse2 v_ArrVal_39) 0) 2))))) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse5) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse7 (store c_A c_l v_ArrVal_37))) (let ((.cse6 (+ 2 (select (store (store .cse7 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (or (< c_min .cse6) (< (select .cse7 i) .cse6))))))) (< v_k_12 .cse8))) (<= c_min c_max) .cse9 (forall ((v_k_12 Int)) (or (< v_k_12 .cse8) (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse5) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse11 (store c_A c_l v_ArrVal_37))) (let ((.cse10 (select .cse11 i))) (or (< .cse10 (+ 2 (select (store (store .cse11 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0))) (< c_min .cse10))))))))) (or .cse9 .cse1) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse12 (store c_A c_l v_ArrVal_37))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse12 v_k_12 v_ArrVal_38) .cse2 v_ArrVal_39) 0)))) (forall ((i Int)) (<= (select .cse12 i) c_min)) (< (+ v_ArrVal_37 1) .cse5)))) (< v_k_12 .cse8))) (<= 0 c_k) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse13 (select c_A i))) (or (< c_min .cse13) (< .cse13 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))))) is different from false [2025-01-30 00:44:19,550 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] [2025-01-30 00:44:22,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-30 00:44:24,228 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] [2025-01-30 00:44:26,317 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] [2025-01-30 00:44:28,340 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2)))) (.cse2 (select c_A c_l)) (.cse6 (+ (select c_A c_k) 1)) (.cse1 (+ c_l 1)) (.cse5 (+ c_k 1))) (and (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse0 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))) (or (< (select c_A i) .cse0) (< c_min .cse0)))) (not (= .cse1 0)) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse2) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse4 (store c_A c_l v_ArrVal_37))) (let ((.cse3 (+ 2 (select (store (store .cse4 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (or (< c_min .cse3) (< (select .cse4 i) .cse3))))))) (< v_k_12 .cse5))) (<= c_min c_max) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse6) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse9 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse8 (store .cse9 c_l v_ArrVal_37))) (let ((.cse7 (select .cse8 i))) (or (< c_min .cse7) (< .cse7 (+ 2 (select (store (store .cse8 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0))))))) (< (+ v_ArrVal_37 1) (select .cse9 c_l))))) (< v_k_12 .cse5))))) .cse10 (forall ((v_k_12 Int)) (or (< v_k_12 .cse5) (forall ((v_ArrVal_37 Int)) (or (< (+ v_ArrVal_37 1) .cse2) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse12 (store c_A c_l v_ArrVal_37))) (let ((.cse11 (select .cse12 i))) (or (< .cse11 (+ 2 (select (store (store .cse12 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0))) (< c_min .cse11))))))))) (forall ((v_ArrVal_36 Int)) (or (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse14 (store c_A c_k v_ArrVal_36))) (let ((.cse13 (store .cse14 c_l v_ArrVal_37))) (or (forall ((i Int)) (<= (select .cse13 i) c_min)) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse13 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (< (+ v_ArrVal_37 1) (select .cse14 c_l)))))) (< v_k_12 .cse5))) (< v_ArrVal_36 .cse6))) (or .cse10 (forall ((i Int)) (<= (select c_A i) c_min))) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse15 (store c_A c_l v_ArrVal_37))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int)) (< c_min (+ 2 (select (store (store .cse15 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (forall ((i Int)) (<= (select .cse15 i) c_min)) (< (+ v_ArrVal_37 1) .cse2)))) (< v_k_12 .cse5))) (forall ((v_ArrVal_36 Int)) (or (< v_ArrVal_36 .cse6) (forall ((v_k_12 Int)) (or (forall ((v_ArrVal_37 Int)) (let ((.cse18 (store c_A c_k v_ArrVal_36))) (or (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse17 (store .cse18 c_l v_ArrVal_37))) (let ((.cse16 (+ 2 (select (store (store .cse17 v_k_12 v_ArrVal_38) .cse1 v_ArrVal_39) 0)))) (or (< c_min .cse16) (< (select .cse17 i) .cse16))))) (< (+ v_ArrVal_37 1) (select .cse18 c_l))))) (< v_k_12 .cse5))))) (<= 0 c_k) (forall ((v_ArrVal_39 Int) (v_ArrVal_38 Int) (i Int)) (let ((.cse19 (select c_A i))) (or (< c_min .cse19) (< .cse19 (+ (select (store (store c_A c_k v_ArrVal_38) c_l v_ArrVal_39) 0) 2))))))) is different from false [2025-01-30 00:44:30,377 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] [2025-01-30 00:44:32,379 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] [2025-01-30 00:44:34,380 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] [2025-01-30 00:44:36,389 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] [2025-01-30 00:44:38,391 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] [2025-01-30 00:44:40,392 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] [2025-01-30 00:44:42,396 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] [2025-01-30 00:44:44,398 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] [2025-01-30 00:44:46,400 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] [2025-01-30 00:45:09,160 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] [2025-01-30 00:45:11,162 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] [2025-01-30 00:45:13,237 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] [2025-01-30 00:45:16,523 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] [2025-01-30 00:45:18,524 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] [2025-01-30 00:45:20,526 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] [2025-01-30 00:45:22,540 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] [2025-01-30 00:45:24,565 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] [2025-01-30 00:45:26,567 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] [2025-01-30 00:45:28,569 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] [2025-01-30 00:45:30,582 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] [2025-01-30 00:45:32,584 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] [2025-01-30 00:45:34,585 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] [2025-01-30 00:45:36,589 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] [2025-01-30 00:45:38,591 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] [2025-01-30 00:45:40,605 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] [2025-01-30 00:45:42,615 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] [2025-01-30 00:45:44,619 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] [2025-01-30 00:45:46,621 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] [2025-01-30 00:45:48,627 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] [2025-01-30 00:45:50,629 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] [2025-01-30 00:45:52,630 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] [2025-01-30 00:45:54,633 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] [2025-01-30 00:45:56,636 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] [2025-01-30 00:45:58,637 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] [2025-01-30 00:46:00,643 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] [2025-01-30 00:46:02,645 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] [2025-01-30 00:46:04,647 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] [2025-01-30 00:46:06,680 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] [2025-01-30 00:46:08,682 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] [2025-01-30 00:46:10,684 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] [2025-01-30 00:46:12,691 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] [2025-01-30 00:46:14,693 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] [2025-01-30 00:46:16,709 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] [2025-01-30 00:46:18,713 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] [2025-01-30 00:46:21,559 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] [2025-01-30 00:46:23,561 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] [2025-01-30 00:46:25,567 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] [2025-01-30 00:46:27,569 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] [2025-01-30 00:46:30,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] [2025-01-30 00:46:32,753 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] [2025-01-30 00:46:34,853 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] [2025-01-30 00:46:48,574 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] [2025-01-30 00:46:50,586 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] [2025-01-30 00:46:52,602 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] [2025-01-30 00:46:55,094 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] [2025-01-30 00:47:17,489 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] [2025-01-30 00:47:19,505 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] [2025-01-30 00:47:22,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] [2025-01-30 00:47:24,390 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... [2025-01-30 00:47:26,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-30 00:47:26,181 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-30 00:47:26,181 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-01-30 00:47:26,181 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-30 00:47:26,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 00:47:26,355 WARN L596 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2025-01-30 00:47:26,357 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (5 of 6 remaining) [2025-01-30 00:47:26,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-01-30 00:47:26,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-30 00:47:26,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-30 00:47:26,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-30 00:47:26,358 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-30 00:47:26,362 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1, 1, 1] [2025-01-30 00:47:26,364 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-30 00:47:26,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-30 00:47:26,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-30 00:47:26,392 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:47:26 BasicIcfg [2025-01-30 00:47:26,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-30 00:47:26,393 INFO L158 Benchmark]: Toolchain (without parser) took 861151.98ms. Allocated memory was 167.8MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 99.5MB in the beginning and 10.4GB in the end (delta: -10.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2025-01-30 00:47:26,393 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:47:26,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.06ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 94.3MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:47:26,393 INFO L158 Benchmark]: Boogie Preprocessor took 20.01ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 93.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 00:47:26,393 INFO L158 Benchmark]: RCFGBuilder took 223.56ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 83.7MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2025-01-30 00:47:26,393 INFO L158 Benchmark]: TraceAbstraction took 860880.94ms. Allocated memory was 167.8MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 82.7MB in the beginning and 10.4GB in the end (delta: -10.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2025-01-30 00:47:26,394 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.18ms. Allocated memory is still 167.8MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 22.06ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 94.3MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 20.01ms. Allocated memory is still 167.8MB. Free memory was 94.3MB in the beginning and 93.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 223.56ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 83.7MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 860880.94ms. Allocated memory was 167.8MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 82.7MB in the beginning and 10.4GB in the end (delta: -10.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14472247, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 1380935, dependent conditional: 1380907, dependent unconditional: 28, unknown: 614, unknown conditional: 614, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13362500, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 271188, dependent conditional: 271160, dependent unconditional: 28, unknown: 614, unknown conditional: 614, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13362500, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 271188, dependent conditional: 271160, dependent unconditional: 28, unknown: 614, unknown conditional: 614, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15618897, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 2527584, dependent conditional: 2527556, dependent unconditional: 28, unknown: 615, unknown conditional: 615, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15618897, independent: 13090698, independent conditional: 114433, independent unconditional: 12976265, dependent: 2527584, dependent conditional: 1572746, dependent unconditional: 954838, unknown: 615, unknown conditional: 615, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15618897, independent: 13090698, independent conditional: 114433, independent unconditional: 12976265, dependent: 2527584, dependent conditional: 1572746, dependent unconditional: 954838, unknown: 615, unknown conditional: 615, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2564, independent: 1688, independent conditional: 173, independent unconditional: 1515, dependent: 867, dependent conditional: 839, dependent unconditional: 28, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2564, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 1055, dependent conditional: 0, dependent unconditional: 1055, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1055, independent: 179, independent conditional: 173, independent unconditional: 6, dependent: 867, dependent conditional: 839, dependent unconditional: 28, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1055, independent: 179, independent conditional: 173, independent unconditional: 6, dependent: 867, dependent conditional: 839, dependent unconditional: 28, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22848, independent: 2927, independent conditional: 2853, independent unconditional: 75, dependent: 10763, dependent conditional: 10029, dependent unconditional: 733, unknown: 9158, unknown conditional: 9158, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 15618897, independent: 13089010, independent conditional: 114260, independent unconditional: 12974750, dependent: 2526717, dependent conditional: 1571907, dependent unconditional: 954810, unknown: 3170, unknown conditional: 1627, unknown unconditional: 1543] , Statistics on independence cache: Total cache size (in pairs): 2564, Positive cache size: 1688, Positive conditional cache size: 173, Positive unconditional cache size: 1515, Negative cache size: 867, Negative conditional cache size: 839, Negative unconditional cache size: 28, Unknown cache size: 9, Unknown conditional cache size: 9, Unknown unconditional cache size: 0, Eliminated conditions: 13929331, Maximal queried relation: 15, Independence queries for same thread: 1109747, Persistent sets #1 benchmarks: Persistent set computation time: 1.4s, Number of persistent set computation: 6162, Number of trivial persistent sets: 4521, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1772, independent: 1744, independent conditional: 0, independent unconditional: 1744, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14472247, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 1380935, dependent conditional: 1380907, dependent unconditional: 28, unknown: 614, unknown conditional: 614, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13362500, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 271188, dependent conditional: 271160, dependent unconditional: 28, unknown: 614, unknown conditional: 614, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13362500, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 271188, dependent conditional: 271160, dependent unconditional: 28, unknown: 614, unknown conditional: 614, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15618897, independent: 13090698, independent conditional: 13088954, independent unconditional: 1744, dependent: 2527584, dependent conditional: 2527556, dependent unconditional: 28, unknown: 615, unknown conditional: 615, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15618897, independent: 13090698, independent conditional: 114433, independent unconditional: 12976265, dependent: 2527584, dependent conditional: 1572746, dependent unconditional: 954838, unknown: 615, unknown conditional: 615, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15618897, independent: 13090698, independent conditional: 114433, independent unconditional: 12976265, dependent: 2527584, dependent conditional: 1572746, dependent unconditional: 954838, unknown: 615, unknown conditional: 615, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2564, independent: 1688, independent conditional: 173, independent unconditional: 1515, dependent: 867, dependent conditional: 839, dependent unconditional: 28, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2564, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 1055, dependent conditional: 0, dependent unconditional: 1055, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1055, independent: 179, independent conditional: 173, independent unconditional: 6, dependent: 867, dependent conditional: 839, dependent unconditional: 28, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1055, independent: 179, independent conditional: 173, independent unconditional: 6, dependent: 867, dependent conditional: 839, dependent unconditional: 28, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22848, independent: 2927, independent conditional: 2853, independent unconditional: 75, dependent: 10763, dependent conditional: 10029, dependent unconditional: 733, unknown: 9158, unknown conditional: 9158, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 15618897, independent: 13089010, independent conditional: 114260, independent unconditional: 12974750, dependent: 2526717, dependent conditional: 1571907, dependent unconditional: 954810, unknown: 3170, unknown conditional: 1627, unknown unconditional: 1543] , Statistics on independence cache: Total cache size (in pairs): 2564, Positive cache size: 1688, Positive conditional cache size: 173, Positive unconditional cache size: 1515, Negative cache size: 867, Negative conditional cache size: 839, Negative unconditional cache size: 28, Unknown cache size: 9, Unknown conditional cache size: 9, Unknown unconditional cache size: 0, Eliminated conditions: 13929331, Maximal queried relation: 15, Independence queries for same thread: 1109747 - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 11 procedures, 75 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 860.7s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 821.4s, 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: 224, 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, 38.1s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 845 ConstructedInterpolants, 34 QuantifiedInterpolants, 11338 SizeOfPredicates, 22 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 17/58 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 2, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown