/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-06 13:30:12,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 13:30:12,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 13:30:12,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 13:30:12,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 13:30:12,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 13:30:12,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 13:30:12,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 13:30:12,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 13:30:12,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 13:30:12,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 13:30:12,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 13:30:12,696 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 13:30:12,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 13:30:12,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 13:30:12,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 13:30:12,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 13:30:12,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 13:30:12,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 13:30:12,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 13:30:12,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 13:30:12,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 13:30:12,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 13:30:12,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 13:30:12,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 13:30:12,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 13:30:12,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 13:30:12,700 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 13:30:12,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 13:30:12,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 13:30:12,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 13:30:12,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-04-06 13:30:12,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 13:30:12,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 13:30:12,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 13:30:12,966 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 13:30:12,967 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 13:30:12,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc.wvr.bpl [2024-04-06 13:30:12,968 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc.wvr.bpl' [2024-04-06 13:30:12,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 13:30:12,996 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 13:30:12,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 13:30:12,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 13:30:12,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 13:30:13,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,020 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 13:30:13,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 13:30:13,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 13:30:13,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 13:30:13,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 13:30:13,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 13:30:13,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 13:30:13,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 13:30:13,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 13:30:13,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/1) ... [2024-04-06 13:30:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 13:30:13,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:30:13,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-06 13:30:13,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-06 13:30:13,117 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 13:30:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 13:30:13,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 13:30:13,118 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 13:30:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 13:30:13,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 13:30:13,118 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 13:30:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 13:30:13,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 13:30:13,119 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 13:30:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 13:30:13,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 13:30:13,119 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 13:30:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 13:30:13,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 13:30:13,120 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 13:30:13,159 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 13:30:13,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 13:30:13,257 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 13:30:13,270 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 13:30:13,270 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-06 13:30:13,272 INFO L201 PluginConnector]: Adding new model min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:30:13 BoogieIcfgContainer [2024-04-06 13:30:13,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 13:30:13,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 13:30:13,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 13:30:13,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 13:30:13,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 01:30:12" (1/2) ... [2024-04-06 13:30:13,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96f4460 and model type min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 01:30:13, skipping insertion in model container [2024-04-06 13:30:13,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 01:30:13" (2/2) ... [2024-04-06 13:30:13,278 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-inc.wvr.bpl [2024-04-06 13:30:13,283 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 13:30:13,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 13:30:13,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 13:30:13,290 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 13:30:13,319 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-06 13:30:13,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 13:30:13,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 13:30:13,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:30:13,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-06 13:30:13,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-06 13:30:13,386 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 13:30:13,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:13,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 13:30:13,410 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d14790f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-06 13:30:13,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-06 13:30:13,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:13,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times [2024-04-06 13:30:13,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734444816] [2024-04-06 13:30:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:13,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:13,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734444816] [2024-04-06 13:30:13,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734444816] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:13,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:13,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-06 13:30:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100385867] [2024-04-06 13:30:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 13:30:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 13:30:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-06 13:30:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:13,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:13,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:13,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:14,517 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:14,518 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 23 treesize of output 21 [2024-04-06 13:30:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 1 times [2024-04-06 13:30:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:15,101 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:15,101 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 23 treesize of output 21 [2024-04-06 13:30:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 1 times [2024-04-06 13:30:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:15,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-04-06 13:30:15,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:15,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1570933513, now seen corresponding path program 1 times [2024-04-06 13:30:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985552086] [2024-04-06 13:30:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985552086] [2024-04-06 13:30:15,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985552086] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:15,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:15,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 13:30:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626068087] [2024-04-06 13:30:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:15,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 13:30:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 13:30:15,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 13:30:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:15,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:15,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:15,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:15,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:15,612 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:15,612 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 23 treesize of output 21 [2024-04-06 13:30:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 2 times [2024-04-06 13:30:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:15,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:16,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:16,019 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 23 treesize of output 21 [2024-04-06 13:30:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 2 times [2024-04-06 13:30:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable9 [2024-04-06 13:30:16,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:16,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times [2024-04-06 13:30:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629537095] [2024-04-06 13:30:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629537095] [2024-04-06 13:30:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629537095] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 13:30:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357576749] [2024-04-06 13:30:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 13:30:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 13:30:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 13:30:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:16,225 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:16,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:16,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:16,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:16,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:16,515 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 23 treesize of output 21 [2024-04-06 13:30:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 3 times [2024-04-06 13:30:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:18,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:19,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:19,083 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 23 treesize of output 21 [2024-04-06 13:30:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 3 times [2024-04-06 13:30:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:19,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:19,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2024-04-06 13:30:19,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:19,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times [2024-04-06 13:30:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:19,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963318746] [2024-04-06 13:30:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:19,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963318746] [2024-04-06 13:30:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963318746] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 13:30:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078755166] [2024-04-06 13:30:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:19,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 13:30:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 13:30:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 13:30:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:19,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:19,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:19,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:19,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:19,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:19,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:19,545 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 23 treesize of output 21 [2024-04-06 13:30:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 4 times [2024-04-06 13:30:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:19,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:19,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:19,930 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 23 treesize of output 21 [2024-04-06 13:30:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 4 times [2024-04-06 13:30:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:20,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:20,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 13:30:20,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:20,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:20,124 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times [2024-04-06 13:30:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:20,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164510753] [2024-04-06 13:30:20,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:20,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:20,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164510753] [2024-04-06 13:30:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164510753] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 13:30:20,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515777115] [2024-04-06 13:30:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:20,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 13:30:20,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:30:20,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 13:30:20,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-06 13:30:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:20,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 13:30:20,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 13:30:20,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-06 13:30:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:20,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 13:30:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:20,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515777115] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 13:30:20,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 13:30:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-06 13:30:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767131797] [2024-04-06 13:30:20,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 13:30:20,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-06 13:30:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-06 13:30:20,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-06 13:30:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:20,645 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:20,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:20,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:20,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:20,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:20,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:20,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:21,017 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:21,018 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 23 treesize of output 21 [2024-04-06 13:30:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 1 times [2024-04-06 13:30:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:23,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:23,424 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:23,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 75 [2024-04-06 13:30:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 5 times [2024-04-06 13:30:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:24,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:24,220 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 23 treesize of output 21 [2024-04-06 13:30:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 1 times [2024-04-06 13:30:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:24,642 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:24,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 75 [2024-04-06 13:30:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 5 times [2024-04-06 13:30:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:25,438 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:25,439 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 23 treesize of output 21 [2024-04-06 13:30:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 1 times [2024-04-06 13:30:25,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:25,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:25,872 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:25,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 61 [2024-04-06 13:30:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash -85839542, now seen corresponding path program 1 times [2024-04-06 13:30:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:26,404 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:26,404 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 23 treesize of output 21 [2024-04-06 13:30:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 1 times [2024-04-06 13:30:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:28,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:28,253 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 23 treesize of output 21 [2024-04-06 13:30:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash 400415002, now seen corresponding path program 1 times [2024-04-06 13:30:28,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:28,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-06 13:30:28,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-06 13:30:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-06 13:30:28,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:28,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times [2024-04-06 13:30:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:28,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888014663] [2024-04-06 13:30:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:29,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888014663] [2024-04-06 13:30:29,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888014663] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:29,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:29,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 13:30:29,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955431466] [2024-04-06 13:30:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:29,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 13:30:29,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:29,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 13:30:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 13:30:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:29,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:29,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:29,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:29,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:29,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:29,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:29,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-06 13:30:29,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:29,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:29,250 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 23 treesize of output 21 [2024-04-06 13:30:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 2 times [2024-04-06 13:30:29,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:29,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:29,567 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 23 treesize of output 21 [2024-04-06 13:30:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 6 times [2024-04-06 13:30:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:32,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:32,019 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 23 treesize of output 21 [2024-04-06 13:30:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 2 times [2024-04-06 13:30:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:32,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:32,382 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:32,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 75 [2024-04-06 13:30:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 6 times [2024-04-06 13:30:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:33,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:33,178 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 23 treesize of output 21 [2024-04-06 13:30:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 2 times [2024-04-06 13:30:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:33,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:33,524 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:33,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 75 [2024-04-06 13:30:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -85839542, now seen corresponding path program 2 times [2024-04-06 13:30:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:34,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:34,297 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 23 treesize of output 21 [2024-04-06 13:30:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 2 times [2024-04-06 13:30:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:34,930 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:34,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 59 [2024-04-06 13:30:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash 400415002, now seen corresponding path program 2 times [2024-04-06 13:30:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:35,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:35,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:35,612 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:35,613 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 23 treesize of output 21 [2024-04-06 13:30:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 3 times [2024-04-06 13:30:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:36,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:36,103 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 23 treesize of output 21 [2024-04-06 13:30:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 4 times [2024-04-06 13:30:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:36,660 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:36,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 66 [2024-04-06 13:30:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 1 times [2024-04-06 13:30:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:37,243 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:37,243 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 23 treesize of output 21 [2024-04-06 13:30:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 3 times [2024-04-06 13:30:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:37,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:37,578 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:37,579 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 23 treesize of output 21 [2024-04-06 13:30:39,657 INFO L85 PathProgramCache]: Analyzing trace with hash -377654899, now seen corresponding path program 4 times [2024-04-06 13:30:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:39,999 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:39,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 66 [2024-04-06 13:30:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash -318345427, now seen corresponding path program 1 times [2024-04-06 13:30:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-06 13:30:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable35,SelfDestructingSolverStorable57,SelfDestructingSolverStorable36,SelfDestructingSolverStorable58,SelfDestructingSolverStorable37,SelfDestructingSolverStorable59,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable40,SelfDestructingSolverStorable62,SelfDestructingSolverStorable41,SelfDestructingSolverStorable63,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-04-06 13:30:40,217 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:40,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times [2024-04-06 13:30:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:40,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71069642] [2024-04-06 13:30:40,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71069642] [2024-04-06 13:30:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71069642] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:40,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 13:30:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410055143] [2024-04-06 13:30:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:40,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 13:30:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 13:30:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 13:30:40,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:40,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:40,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:40,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:40,459 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:40,460 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 23 treesize of output 21 [2024-04-06 13:30:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 5 times [2024-04-06 13:30:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:41,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:41,473 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:41,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 61 [2024-04-06 13:30:41,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 7 times [2024-04-06 13:30:41,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:41,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:41,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:41,927 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 23 treesize of output 21 [2024-04-06 13:30:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 5 times [2024-04-06 13:30:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:42,300 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:42,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 75 [2024-04-06 13:30:42,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 7 times [2024-04-06 13:30:42,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:42,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:42,861 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:42,861 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 23 treesize of output 21 [2024-04-06 13:30:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 3 times [2024-04-06 13:30:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:43,218 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:43,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 59 [2024-04-06 13:30:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -85839542, now seen corresponding path program 3 times [2024-04-06 13:30:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:43,678 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:43,679 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 23 treesize of output 21 [2024-04-06 13:30:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 3 times [2024-04-06 13:30:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:43,982 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:43,982 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 23 treesize of output 21 [2024-04-06 13:30:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 400415002, now seen corresponding path program 3 times [2024-04-06 13:30:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:44,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:44,424 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 23 treesize of output 21 [2024-04-06 13:30:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 6 times [2024-04-06 13:30:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:44,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:44,750 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 23 treesize of output 21 [2024-04-06 13:30:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 7 times [2024-04-06 13:30:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:47,228 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 13:30:47,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 66 [2024-04-06 13:30:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 2 times [2024-04-06 13:30:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:47,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:47,709 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 23 treesize of output 21 [2024-04-06 13:30:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 6 times [2024-04-06 13:30:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:47,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:47,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:48,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:48,042 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 23 treesize of output 21 [2024-04-06 13:30:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash -377654899, now seen corresponding path program 7 times [2024-04-06 13:30:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:48,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 13:30:48,421 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 30 treesize of output 26 [2024-04-06 13:30:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -318345427, now seen corresponding path program 2 times [2024-04-06 13:30:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:48,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-06 13:30:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:48,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable70,SelfDestructingSolverStorable92,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable64,SelfDestructingSolverStorable86,SelfDestructingSolverStorable65,SelfDestructingSolverStorable87,SelfDestructingSolverStorable66,SelfDestructingSolverStorable88,SelfDestructingSolverStorable67,SelfDestructingSolverStorable89,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-04-06 13:30:48,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:48,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 2 times [2024-04-06 13:30:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:48,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355332205] [2024-04-06 13:30:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355332205] [2024-04-06 13:30:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355332205] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 13:30:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619773] [2024-04-06 13:30:48,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 13:30:48,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 13:30:48,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:30:48,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 13:30:48,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-06 13:30:48,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 13:30:48,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 13:30:48,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2024-04-06 13:30:48,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 13:30:48,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-04-06 13:30:48,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-04-06 13:30:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:48,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 13:30:49,029 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-04-06 13:30:49,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 98 [2024-04-06 13:30:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:30:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619773] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 13:30:49,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 13:30:49,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-04-06 13:30:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982143959] [2024-04-06 13:30:49,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 13:30:49,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-04-06 13:30:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-04-06 13:30:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-04-06 13:30:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:49,079 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:49,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:49,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:49,464 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:49,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 8 times [2024-04-06 13:30:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:49,881 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:49,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841255, now seen corresponding path program 9 times [2024-04-06 13:30:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:49,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:50,310 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:50,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 8 times [2024-04-06 13:30:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:50,738 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:50,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -498663731, now seen corresponding path program 9 times [2024-04-06 13:30:52,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:52,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:53,136 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:53,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 4 times [2024-04-06 13:30:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:53,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:53,497 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:53,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 5 times [2024-04-06 13:30:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:53,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:53,817 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:53,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 4 times [2024-04-06 13:30:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:54,196 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:54,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 5 times [2024-04-06 13:30:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:54,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:54,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:54,696 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:54,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 10 times [2024-04-06 13:30:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:55,154 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 10 times [2024-04-06 13:30:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:55,684 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:55,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash 59462866, now seen corresponding path program 6 times [2024-04-06 13:30:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:55,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:56,067 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:56,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -862819196, now seen corresponding path program 6 times [2024-04-06 13:30:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-06 13:30:56,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-06 13:30:56,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,SelfDestructingSolverStorable110,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable111,SelfDestructingSolverStorable101,SelfDestructingSolverStorable112,SelfDestructingSolverStorable102,SelfDestructingSolverStorable113,SelfDestructingSolverStorable103 [2024-04-06 13:30:56,726 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:30:56,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:30:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash 468809223, now seen corresponding path program 3 times [2024-04-06 13:30:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:30:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814143524] [2024-04-06 13:30:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:56,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:30:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:30:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814143524] [2024-04-06 13:30:56,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814143524] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:30:56,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:30:56,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 13:30:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752387963] [2024-04-06 13:30:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:30:56,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 13:30:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:30:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 13:30:56,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 13:30:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:56,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:30:56,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-06 13:30:56,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:30:57,002 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:57,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 11 times [2024-04-06 13:30:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:57,366 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:57,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841255, now seen corresponding path program 12 times [2024-04-06 13:30:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:57,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:57,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:58,209 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:58,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 11 times [2024-04-06 13:30:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:58,543 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:58,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -498663731, now seen corresponding path program 12 times [2024-04-06 13:30:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:58,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:58,949 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:58,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 7 times [2024-04-06 13:30:58,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:58,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:59,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:59,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:59,260 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:59,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 8 times [2024-04-06 13:30:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:59,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:59,549 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:59,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 7 times [2024-04-06 13:30:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:59,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:30:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:30:59,857 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:30:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:30:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 8 times [2024-04-06 13:30:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:30:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:30:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:30:59,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:30:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:00,387 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:00,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 13 times [2024-04-06 13:31:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:00,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:00,793 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 13 times [2024-04-06 13:31:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:00,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:01,207 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:01,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:03,274 INFO L85 PathProgramCache]: Analyzing trace with hash 59462866, now seen corresponding path program 9 times [2024-04-06 13:31:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:03,575 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:03,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash -862819196, now seen corresponding path program 9 times [2024-04-06 13:31:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:04,341 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:04,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:04,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1245943147, now seen corresponding path program 14 times [2024-04-06 13:31:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:04,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:04,772 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:04,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1372743187, now seen corresponding path program 15 times [2024-04-06 13:31:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:04,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:04,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:05,058 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:05,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1074547559, now seen corresponding path program 16 times [2024-04-06 13:31:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:05,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:05,476 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:05,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2032973603, now seen corresponding path program 17 times [2024-04-06 13:31:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:05,985 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:05,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1092399783, now seen corresponding path program 14 times [2024-04-06 13:31:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:06,419 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:06,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1502192207, now seen corresponding path program 15 times [2024-04-06 13:31:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:06,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:06,655 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:06,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1075065387, now seen corresponding path program 16 times [2024-04-06 13:31:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:06,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:07,057 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:07,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -778331161, now seen corresponding path program 17 times [2024-04-06 13:31:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-06 13:31:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable144,SelfDestructingSolverStorable123,SelfDestructingSolverStorable145,SelfDestructingSolverStorable124,SelfDestructingSolverStorable146,SelfDestructingSolverStorable125,SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable120,SelfDestructingSolverStorable142,SelfDestructingSolverStorable121,SelfDestructingSolverStorable143,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable137,SelfDestructingSolverStorable116,SelfDestructingSolverStorable138,SelfDestructingSolverStorable117,SelfDestructingSolverStorable139,SelfDestructingSolverStorable118,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable114,SelfDestructingSolverStorable136 [2024-04-06 13:31:07,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:31:07,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:31:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash -615186039, now seen corresponding path program 2 times [2024-04-06 13:31:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:31:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788797343] [2024-04-06 13:31:07,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:31:07,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:31:07,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788797343] [2024-04-06 13:31:07,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788797343] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 13:31:07,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 13:31:07,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 13:31:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41686010] [2024-04-06 13:31:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 13:31:07,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 13:31:07,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:31:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 13:31:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 13:31:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:31:07,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:31:07,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:31:07,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:31:07,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:07,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:31:07,621 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:07,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 18 times [2024-04-06 13:31:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:07,973 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:07,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841255, now seen corresponding path program 19 times [2024-04-06 13:31:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:09,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:10,234 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:10,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 18 times [2024-04-06 13:31:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:10,598 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:10,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash -498663731, now seen corresponding path program 19 times [2024-04-06 13:31:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:10,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:10,924 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:10,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 10 times [2024-04-06 13:31:10,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:11,347 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:11,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 11 times [2024-04-06 13:31:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:11,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:11,653 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 10 times [2024-04-06 13:31:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:11,955 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:11,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 11 times [2024-04-06 13:31:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:12,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:12,365 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:12,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 20 times [2024-04-06 13:31:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:12,898 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:12,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 20 times [2024-04-06 13:31:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:13,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:13,342 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:13,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 59462866, now seen corresponding path program 12 times [2024-04-06 13:31:13,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:13,716 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:13,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash -862819196, now seen corresponding path program 12 times [2024-04-06 13:31:13,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:14,294 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:14,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1245943147, now seen corresponding path program 21 times [2024-04-06 13:31:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:14,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:14,811 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:14,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1372743187, now seen corresponding path program 22 times [2024-04-06 13:31:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:15,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:15,444 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1074547559, now seen corresponding path program 23 times [2024-04-06 13:31:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:15,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:15,738 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:15,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2032973603, now seen corresponding path program 24 times [2024-04-06 13:31:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:16,180 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:16,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1092399783, now seen corresponding path program 21 times [2024-04-06 13:31:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:16,622 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:16,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1502192207, now seen corresponding path program 22 times [2024-04-06 13:31:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:18,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:18,871 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:18,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1075065387, now seen corresponding path program 23 times [2024-04-06 13:31:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:20,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:20,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:20,369 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:20,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash -778331161, now seen corresponding path program 24 times [2024-04-06 13:31:20,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:31:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-06 13:31:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-06 13:31:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable173,SelfDestructingSolverStorable152,SelfDestructingSolverStorable174,SelfDestructingSolverStorable153,SelfDestructingSolverStorable175,SelfDestructingSolverStorable154,SelfDestructingSolverStorable176,SelfDestructingSolverStorable170,SelfDestructingSolverStorable171,SelfDestructingSolverStorable150,SelfDestructingSolverStorable172,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149,SelfDestructingSolverStorable166,SelfDestructingSolverStorable167,SelfDestructingSolverStorable168,SelfDestructingSolverStorable147,SelfDestructingSolverStorable169,SelfDestructingSolverStorable162,SelfDestructingSolverStorable163,SelfDestructingSolverStorable164,SelfDestructingSolverStorable165,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable159,SelfDestructingSolverStorable155,SelfDestructingSolverStorable177,SelfDestructingSolverStorable156,SelfDestructingSolverStorable178,SelfDestructingSolverStorable157,SelfDestructingSolverStorable179,SelfDestructingSolverStorable158 [2024-04-06 13:31:20,566 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-06 13:31:20,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 13:31:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1387107595, now seen corresponding path program 1 times [2024-04-06 13:31:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 13:31:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527481430] [2024-04-06 13:31:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 13:31:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 13:31:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527481430] [2024-04-06 13:31:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527481430] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 13:31:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447185290] [2024-04-06 13:31:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:20,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 13:31:20,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 13:31:20,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-06 13:31:20,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-06 13:31:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:20,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2024-04-06 13:31:20,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 13:31:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:31:20,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 13:31:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 13:31:20,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447185290] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 13:31:20,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 13:31:20,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 9 [2024-04-06 13:31:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109546264] [2024-04-06 13:31:20,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 13:31:20,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-06 13:31:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 13:31:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-06 13:31:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-04-06 13:31:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:31:20,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 13:31:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 13:31:20,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 13:31:21,177 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:21,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 419959735, now seen corresponding path program 25 times [2024-04-06 13:31:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:21,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:21,530 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:21,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:21,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 26 times [2024-04-06 13:31:21,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:22,014 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:22,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841255, now seen corresponding path program 27 times [2024-04-06 13:31:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:22,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:22,282 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:22,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash 743706275, now seen corresponding path program 28 times [2024-04-06 13:31:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:22,872 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:22,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:22,935 INFO L85 PathProgramCache]: Analyzing trace with hash 896821661, now seen corresponding path program 25 times [2024-04-06 13:31:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:23,148 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 26 times [2024-04-06 13:31:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:24,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:25,134 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:25,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash -498663731, now seen corresponding path program 27 times [2024-04-06 13:31:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:25,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:25,416 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:25,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1316177801, now seen corresponding path program 28 times [2024-04-06 13:31:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:25,849 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:25,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash -327903914, now seen corresponding path program 13 times [2024-04-06 13:31:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:26,100 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:26,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 14 times [2024-04-06 13:31:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:26,442 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:26,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 15 times [2024-04-06 13:31:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:28,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:28,804 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:28,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -699910206, now seen corresponding path program 16 times [2024-04-06 13:31:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:28,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:29,198 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:29,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1398602458, now seen corresponding path program 13 times [2024-04-06 13:31:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-04-06 13:31:29,450 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:29,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 14 times [2024-04-06 13:31:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:31,783 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:31,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 15 times [2024-04-06 13:31:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:32,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:32,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 13:31:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 13:31:32,298 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:32,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -465105006, now seen corresponding path program 16 times [2024-04-06 13:31:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:32,863 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:32,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 29 times [2024-04-06 13:31:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:33,281 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:33,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1704662611, now seen corresponding path program 3 times [2024-04-06 13:31:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:35,811 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:35,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 29 times [2024-04-06 13:31:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:35,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:35,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 13:31:36,082 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:36,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1488405899, now seen corresponding path program 3 times [2024-04-06 13:31:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:38,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 13:31:38,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 13:31:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 13:31:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 13:31:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 13:31:38,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-04-06 13:31:38,550 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:38,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:38,802 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:38,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:40,497 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:40,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:40,757 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:40,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:43,439 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:43,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:44,055 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:44,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:44,298 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:44,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:44,720 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:44,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:45,003 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:45,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:45,285 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:45,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:45,732 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:45,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:45,940 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:45,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:48,308 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:48,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:49,007 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:49,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:49,350 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:49,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:49,730 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:49,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:50,205 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:50,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:50,537 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:50,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:50,762 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:50,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:51,012 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:51,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:51,581 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:51,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:52,132 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:52,405 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:52,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:52,653 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:52,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:53,155 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:53,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:53,550 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:53,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:53,801 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:53,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:54,029 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:54,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:54,535 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:54,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:55,047 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:55,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:55,295 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:55,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:55,510 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:55,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:57,057 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:57,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:57,416 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:57,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:57,656 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:57,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:57,889 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:57,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:31:59,025 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:59,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:31:59,276 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:31:59,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:01,667 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:01,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:02,055 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:02,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:02,319 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:02,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:02,601 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:02,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:04,698 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:04,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:05,036 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:05,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:05,578 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:05,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:05,925 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:05,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:06,286 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:06,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:06,530 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:06,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:06,964 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:06,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:07,216 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:07,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:07,620 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:07,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:08,203 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:08,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:08,463 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:08,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:08,733 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:08,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:08,990 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:08,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:09,353 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:09,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:09,732 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:09,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:10,101 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:10,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:10,470 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:10,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:10,712 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:10,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:13,280 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:13,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2024-04-06 13:32:13,509 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 13:32:13,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2024-04-06 13:32:15,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-06 13:32:15,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,SelfDestructingSolverStorable196,SelfDestructingSolverStorable197,SelfDestructingSolverStorable198,SelfDestructingSolverStorable191,SelfDestructingSolverStorable192,SelfDestructingSolverStorable193,SelfDestructingSolverStorable194,SelfDestructingSolverStorable190,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable207,SelfDestructingSolverStorable208,SelfDestructingSolverStorable209,SelfDestructingSolverStorable203,SelfDestructingSolverStorable204,SelfDestructingSolverStorable205,SelfDestructingSolverStorable206,SelfDestructingSolverStorable188,SelfDestructingSolverStorable189,SelfDestructingSolverStorable200,SelfDestructingSolverStorable201,SelfDestructingSolverStorable202,SelfDestructingSolverStorable184,SelfDestructingSolverStorable185,SelfDestructingSolverStorable186,SelfDestructingSolverStorable187,SelfDestructingSolverStorable180,SelfDestructingSolverStorable181,SelfDestructingSolverStorable182,SelfDestructingSolverStorable183,SelfDestructingSolverStorable214,SelfDestructingSolverStorable215,SelfDestructingSolverStorable216,SelfDestructingSolverStorable199,SelfDestructingSolverStorable210,SelfDestructingSolverStorable211,SelfDestructingSolverStorable212,SelfDestructingSolverStorable213 [2024-04-06 13:32:15,830 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@40aa128c at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:183) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-06 13:32:15,834 INFO L158 Benchmark]: Toolchain (without parser) took 122837.12ms. Allocated memory was 173.0MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 137.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-04-06 13:32:15,834 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 173.0MB. Free memory was 139.1MB in the beginning and 139.0MB in the end (delta: 65.6kB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 13:32:15,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.89ms. Allocated memory is still 173.0MB. Free memory was 137.8MB in the beginning and 136.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 13:32:15,834 INFO L158 Benchmark]: Boogie Preprocessor took 23.10ms. Allocated memory is still 173.0MB. Free memory was 136.3MB in the beginning and 135.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 13:32:15,834 INFO L158 Benchmark]: RCFGBuilder took 226.26ms. Allocated memory is still 173.0MB. Free memory was 135.0MB in the beginning and 124.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-04-06 13:32:15,834 INFO L158 Benchmark]: TraceAbstraction took 122559.97ms. Allocated memory was 173.0MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 123.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-04-06 13:32:15,835 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.13ms. Allocated memory is still 173.0MB. Free memory was 139.1MB in the beginning and 139.0MB in the end (delta: 65.6kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.89ms. Allocated memory is still 173.0MB. Free memory was 137.8MB in the beginning and 136.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.10ms. Allocated memory is still 173.0MB. Free memory was 136.3MB in the beginning and 135.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 226.26ms. Allocated memory is still 173.0MB. Free memory was 135.0MB in the beginning and 124.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 122559.97ms. Allocated memory was 173.0MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 123.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@40aa128c de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@40aa128c: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-06 13:32:15,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-06 13:32:16,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...