/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 RANDOM --traceabstraction.probability.for.random.criterion 50 --traceabstraction.seed.for.random.criterion 213 -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 22:28:44,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 22:28:44,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 22:28:44,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 22:28:44,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 22:28:44,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 22:28:44,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 22:28:44,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 22:28:44,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 22:28:44,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 22:28:44,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 22:28:44,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 22:28:44,544 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 22:28:44,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 22:28:44,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 22:28:44,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 22:28:44,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 22:28:44,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 22:28:44,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 22:28:44,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 22:28:44,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 22:28:44,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 22:28:44,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 22:28:44,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 22:28:44,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 22:28:44,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 22:28:44,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 22:28:44,548 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 22:28:44,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 22:28:44,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 22:28:44,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 22:28:44,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 22:28:44,550 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 50 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-06 22:28:44,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 22:28:44,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 22:28:44,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 22:28:44,743 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 22:28:44,743 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 22:28:44,744 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 22:28:44,745 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 22:28:44,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 22:28:44,813 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 22:28:44,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 22:28:44,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 22:28:44,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 22:28:44,825 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,830 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,835 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 22:28:44,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 22:28:44,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 22:28:44,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 22:28:44,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 22:28:44,843 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,843 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,843 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,844 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,845 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,847 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,848 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,849 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 22:28:44,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 22:28:44,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 22:28:44,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 22:28:44,855 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 10:28:44" (1/1) ... [2024-04-06 22:28:44,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 22:28:44,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 22:28:44,877 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 22:28:44,884 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 22:28:44,927 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 22:28:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 22:28:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 22:28:44,927 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 22:28:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 22:28:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 22:28:44,927 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 22:28:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 22:28:44,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 22:28:44,928 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 22:28:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 22:28:44,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 22:28:44,928 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 22:28:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 22:28:44,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 22:28:44,929 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 22:28:44,966 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 22:28:44,967 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 22:28:45,056 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 22:28:45,070 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 22:28:45,071 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-06 22:28:45,072 INFO L201 PluginConnector]: Adding new model min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:28:45 BoogieIcfgContainer [2024-04-06 22:28:45,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 22:28:45,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 22:28:45,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 22:28:45,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 22:28:45,078 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 10:28:44" (1/2) ... [2024-04-06 22:28:45,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31897e76 and model type min-max-inc.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:28:45, skipping insertion in model container [2024-04-06 22:28:45,079 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 10:28:45" (2/2) ... [2024-04-06 22:28:45,080 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-inc.wvr.bpl [2024-04-06 22:28:45,085 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 22:28:45,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 22:28:45,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 22:28:45,093 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 22:28:45,130 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-06 22:28:45,171 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 22:28:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 22:28:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 22:28:45,174 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 22:28:45,180 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 22:28:45,205 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 22:28:45,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:45,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 22:28:45,222 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;@4a537ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=50, mConComCheckerRandomSeed=213 [2024-04-06 22:28:45,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-06 22:28:45,295 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 22:28:45,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times [2024-04-06 22:28:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:45,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818528831] [2024-04-06 22:28:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:45,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:45,543 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 22:28:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818528831] [2024-04-06 22:28:45,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818528831] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:28:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:28:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-06 22:28:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947122913] [2024-04-06 22:28:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:28:45,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 22:28:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 22:28:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-06 22:28:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:45,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:45,569 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 22:28:45,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:46,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:46,075 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 22:28:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 1 times [2024-04-06 22:28:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:46,244 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 22:28:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:46,301 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 22:28:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-04-06 22:28:46,475 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 22:28:46,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1570933513, now seen corresponding path program 1 times [2024-04-06 22:28:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:46,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761788655] [2024-04-06 22:28:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:46,542 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 22:28:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:46,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761788655] [2024-04-06 22:28:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761788655] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:28:46,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:28:46,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 22:28:46,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953150129] [2024-04-06 22:28:46,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:28:46,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 22:28:46,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:46,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 22:28:46,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 22:28:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:46,545 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:46,545 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 22:28:46,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:46,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:46,785 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:46,785 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 22:28:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 2 times [2024-04-06 22:28:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:46,898 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 22:28:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:46,946 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 22:28:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable5 [2024-04-06 22:28:47,090 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 22:28:47,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times [2024-04-06 22:28:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509110619] [2024-04-06 22:28:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:47,135 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 22:28:47,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509110619] [2024-04-06 22:28:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509110619] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:28:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:28:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 22:28:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14387609] [2024-04-06 22:28:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:28:47,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 22:28:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:47,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 22:28:47,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 22:28:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:47,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:47,142 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 22:28:47,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:47,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:47,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:47,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-06 22:28:47,406 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 22:28:47,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:47,406 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times [2024-04-06 22:28:47,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:47,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199454940] [2024-04-06 22:28:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:47,447 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 22:28:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199454940] [2024-04-06 22:28:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199454940] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:28:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:28:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 22:28:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122821866] [2024-04-06 22:28:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:28:47,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 22:28:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 22:28:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 22:28:47,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:47,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:47,450 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 22:28:47,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:47,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:47,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:47,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:47,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28: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 22:28:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1929345323, now seen corresponding path program 3 times [2024-04-06 22:28:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:47,795 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 22:28:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:47,841 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 22:28:48,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:48,074 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 22:28:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 1 times [2024-04-06 22:28:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:48,161 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 22:28:48,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:48,194 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 22:28:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:48,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable9 [2024-04-06 22:28:48,230 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 22:28:48,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times [2024-04-06 22:28:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66440520] [2024-04-06 22:28:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:48,375 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 22:28:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66440520] [2024-04-06 22:28:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66440520] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 22:28:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977435456] [2024-04-06 22:28:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:48,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 22:28:48,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 22:28:48,444 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 22:28:48,491 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 22:28:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:48,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 22:28:48,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 22:28:48,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-06 22:28:48,632 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 22:28:48,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 22:28:48,941 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-04-06 22:28:48,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 24 treesize of output 1 [2024-04-06 22:28:48,942 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 22:28:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977435456] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 22:28:48,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 22:28:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-06 22:28:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27671220] [2024-04-06 22:28:48,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 22:28:48,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-06 22:28:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-06 22:28:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-06 22:28:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:48,947 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:48,947 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 22:28:48,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:48,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:48,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:48,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:48,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:49,482 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:49,482 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 22:28:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 1 times [2024-04-06 22:28:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:49,608 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 22:28:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:49,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:49,643 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 22:28:49,913 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 22:28:49,914 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 61 [2024-04-06 22:28:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1107359761, now seen corresponding path program 2 times [2024-04-06 22:28:50,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:50,088 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 22:28:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:50,109 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 22:28:50,753 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 22:28:50,753 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 112 treesize of output 100 [2024-04-06 22:28:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 400415002, now seen corresponding path program 1 times [2024-04-06 22:28:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:51,074 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 22:28:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:51,101 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 22:28:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-06 22:28:51,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-06 22:28:51,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 22:28:51,445 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 22:28:51,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times [2024-04-06 22:28:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890997167] [2024-04-06 22:28:51,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:51,466 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 22:28:51,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:51,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890997167] [2024-04-06 22:28:51,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890997167] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:28:51,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:28:51,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 22:28:51,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870981981] [2024-04-06 22:28:51,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:28:51,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 22:28:51,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:51,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 22:28:51,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 22:28:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:51,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:51,468 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 22:28:51,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:51,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:51,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:51,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:51,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-06 22:28:51,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:51,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:51,668 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 22:28:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 1 times [2024-04-06 22:28:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:51,775 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 22:28:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:51,804 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 22:28:52,305 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 22:28:52,306 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 69 treesize of output 75 [2024-04-06 22:28:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash -85839542, now seen corresponding path program 1 times [2024-04-06 22:28:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:52,413 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 22:28:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:52,476 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 22:28:52,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:52,702 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 22:28:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1893520736, now seen corresponding path program 1 times [2024-04-06 22:28:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:52,782 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 22:28:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:52,810 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 22:28:53,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:53,277 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 22:28:53,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 2 times [2024-04-06 22:28:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:53,375 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 22:28:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:53,405 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 22:28:53,836 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:53,836 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 22:28:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 1 times [2024-04-06 22:28:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:53,932 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 22:28:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:53,951 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 22:28:54,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:54,177 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 22:28:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 2 times [2024-04-06 22:28:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:54,262 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 22:28:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:54,315 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 22:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-06 22:28:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-06 22:28:54,451 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 22:28:54,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:28:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times [2024-04-06 22:28:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:28:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879691508] [2024-04-06 22:28:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:54,465 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 22:28:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:28:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879691508] [2024-04-06 22:28:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879691508] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:28:54,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:28:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 22:28:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838118253] [2024-04-06 22:28:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:28:54,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 22:28:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:28:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 22:28:54,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 22:28:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:54,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:28:54,466 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 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-06 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:28:54,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:28:54,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:54,898 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 22:28:56,954 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 1 times [2024-04-06 22:28:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:56,981 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 22:28:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:57,005 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 22:28:57,268 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 22:28:57,269 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 112 treesize of output 100 [2024-04-06 22:28:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash -85839542, now seen corresponding path program 2 times [2024-04-06 22:28:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:57,541 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 22:28:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:57,561 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 22:28:58,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:58,054 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 22:28:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 3 times [2024-04-06 22:28:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:58,379 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 22:28:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:58,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 22:28:58,693 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-04-06 22:28:58,693 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 22:28:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 2 times [2024-04-06 22:28:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:59,038 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 22:28:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:59,058 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 22:28:59,230 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:59,230 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 22:28:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 3 times [2024-04-06 22:28:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:59,322 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 22:28:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:28:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:28:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:28:59,350 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 22:28:59,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 22:28:59,544 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 22:29:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash -377654899, now seen corresponding path program 4 times [2024-04-06 22:29:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:01,639 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 22:29:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:01,667 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 22:29:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-06 22:29:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:01,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-04-06 22:29:01,733 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 22:29:01,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:29:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 2 times [2024-04-06 22:29:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:29:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935592344] [2024-04-06 22:29:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:01,841 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 22:29:01,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:29:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935592344] [2024-04-06 22:29:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935592344] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 22:29:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793940714] [2024-04-06 22:29:01,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-06 22:29:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 22:29:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 22:29:01,843 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 22:29:01,876 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 22:29:01,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-06 22:29:01,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-06 22:29:01,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 22:29:01,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 22:29:01,937 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 22:29:01,943 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 22:29:01,955 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 22:29:01,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 22:29:02,176 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-04-06 22:29:02,176 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 32 treesize of output 1 [2024-04-06 22:29:02,185 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-04-06 22:29:02,185 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 48 treesize of output 1 [2024-04-06 22:29:02,185 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 22:29:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793940714] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 22:29:02,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 22:29:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-04-06 22:29:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14035316] [2024-04-06 22:29:02,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 22:29:02,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-06 22:29:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:29:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-06 22:29:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-04-06 22:29:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:02,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:29:02,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) 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 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:02,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:02,468 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:02,469 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 22:29:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 4 times [2024-04-06 22:29:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:02,577 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 22:29:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:02,603 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 22:29:02,804 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:02,804 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 22:29:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841255, now seen corresponding path program 5 times [2024-04-06 22:29:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:04,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:05,415 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:05,415 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 22:29:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 2 times [2024-04-06 22:29:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:05,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:05,777 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:05,777 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 22:29:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 2 times [2024-04-06 22:29:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:05,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:06,324 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:06,324 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 22:29:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 6 times [2024-04-06 22:29:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:06,464 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 22:29:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:06,514 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 22:29:06,703 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:06,705 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 22:29:06,770 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 3 times [2024-04-06 22:29:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:06,795 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 22:29:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:06,821 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 22:29:07,085 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:07,085 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 22:29:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -377654899, now seen corresponding path program 5 times [2024-04-06 22:29:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:07,196 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 22:29:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:07,240 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 22:29:07,667 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:07,671 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 22:29:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 926091972, now seen corresponding path program 1 times [2024-04-06 22:29:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:07,750 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 22:29:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:07,769 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 22:29:07,955 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:07,955 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 22:29:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash -862819196, now seen corresponding path program 3 times [2024-04-06 22:29:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:08,076 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 22:29:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:08,100 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 22:29:08,289 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:08,289 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 22:29:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1703691286, now seen corresponding path program 4 times [2024-04-06 22:29:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:08,391 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 22:29:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:08,416 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 22:29:08,604 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:08,604 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 22:29:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1165340682, now seen corresponding path program 1 times [2024-04-06 22:29:08,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:08,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:08,701 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 22:29:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:08,730 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 22:29:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-06 22:29:08,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-06 22:29:09,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable50,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable62,SelfDestructingSolverStorable52,SelfDestructingSolverStorable63,SelfDestructingSolverStorable53,SelfDestructingSolverStorable64,SelfDestructingSolverStorable54,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55,SelfDestructingSolverStorable45,SelfDestructingSolverStorable56,SelfDestructingSolverStorable46,SelfDestructingSolverStorable57,SelfDestructingSolverStorable47,SelfDestructingSolverStorable58,SelfDestructingSolverStorable48,SelfDestructingSolverStorable59,SelfDestructingSolverStorable49 [2024-04-06 22:29:09,101 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 22:29:09,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:29:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 468809223, now seen corresponding path program 3 times [2024-04-06 22:29:09,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:29:09,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071812468] [2024-04-06 22:29:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:09,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:09,120 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 22:29:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:29:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071812468] [2024-04-06 22:29:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071812468] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:29:09,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:29:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 22:29:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331049702] [2024-04-06 22:29:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:29:09,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 22:29:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:29:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 22:29:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 22:29:09,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:09,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:29:09,122 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 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-06 22:29:09,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:09,363 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:09,364 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 22:29:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1752144719, now seen corresponding path program 7 times [2024-04-06 22:29:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:09,470 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 22:29:09,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:09,494 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 22:29:09,831 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:09,831 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 22:29:09,911 INFO L85 PathProgramCache]: Analyzing trace with hash -498663731, now seen corresponding path program 6 times [2024-04-06 22:29:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:09,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:10,477 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:10,478 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 22:29:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 8 times [2024-04-06 22:29:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:12,601 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 22:29:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:12,628 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 22:29:12,843 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:12,843 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 22:29:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 9 times [2024-04-06 22:29:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:12,949 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 22:29:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:12,975 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 22:29:13,168 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:13,168 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 22:29:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 4 times [2024-04-06 22:29:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:13,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:13,287 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 22:29:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:13,304 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 22:29:13,512 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:13,512 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 22:29:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 7 times [2024-04-06 22:29:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:13,635 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 22:29:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:13,664 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 22:29:13,919 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:13,920 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 22:29:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -377654899, now seen corresponding path program 8 times [2024-04-06 22:29:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:14,041 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 22:29:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:14,072 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 22:29:14,372 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:14,373 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 22:29:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 59462866, now seen corresponding path program 3 times [2024-04-06 22:29:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:14,446 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 22:29:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:14,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:14,475 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 22:29:15,239 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:15,240 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 22:29:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1245943147, now seen corresponding path program 10 times [2024-04-06 22:29:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:15,358 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 22:29:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:15,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:15,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 22:29:15,957 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:15,957 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 22:29:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1502192207, now seen corresponding path program 9 times [2024-04-06 22:29:16,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:16,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:16,247 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:16,247 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 22:29:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1075065387, now seen corresponding path program 10 times [2024-04-06 22:29:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:16,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:16,510 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:16,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 30 treesize of output 34 [2024-04-06 22:29:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash -778331161, now seen corresponding path program 11 times [2024-04-06 22:29:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:16,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:16,597 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 22:29:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:16,616 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 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 22:29:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,SelfDestructingSolverStorable70,SelfDestructingSolverStorable81,SelfDestructingSolverStorable71,SelfDestructingSolverStorable82,SelfDestructingSolverStorable72,SelfDestructingSolverStorable83,SelfDestructingSolverStorable73,SelfDestructingSolverStorable84,SelfDestructingSolverStorable74,SelfDestructingSolverStorable85,SelfDestructingSolverStorable75,SelfDestructingSolverStorable86,SelfDestructingSolverStorable65,SelfDestructingSolverStorable76,SelfDestructingSolverStorable66,SelfDestructingSolverStorable77,SelfDestructingSolverStorable67,SelfDestructingSolverStorable78,SelfDestructingSolverStorable68,SelfDestructingSolverStorable79,SelfDestructingSolverStorable69 [2024-04-06 22:29:16,669 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 22:29:16,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:29:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash -615186039, now seen corresponding path program 2 times [2024-04-06 22:29:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:29:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421370763] [2024-04-06 22:29:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:16,683 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 22:29:16,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:29:16,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421370763] [2024-04-06 22:29:16,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421370763] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 22:29:16,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 22:29:16,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 22:29:16,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691355741] [2024-04-06 22:29:16,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 22:29:16,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 22:29:16,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:29:16,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 22:29:16,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 22:29:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:16,684 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:29:16,684 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 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 22:29:16,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:16,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:17,060 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:17,060 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 22:29:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2139841255, now seen corresponding path program 11 times [2024-04-06 22:29:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:17,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:17,601 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:17,602 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 22:29:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash -498663731, now seen corresponding path program 12 times [2024-04-06 22:29:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:17,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:17,976 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:17,976 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 22:29:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 4 times [2024-04-06 22:29:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:18,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:18,295 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:18,295 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 22:29:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 5 times [2024-04-06 22:29:20,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:20,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:20,775 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:20,775 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 22:29:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 12 times [2024-04-06 22:29:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:20,920 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 22:29:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:20,964 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 22:29:21,160 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:21,160 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 22:29:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash -534602139, now seen corresponding path program 5 times [2024-04-06 22:29:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:21,261 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 22:29:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:21,288 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 22:29:21,614 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:21,614 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 22:29:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash -318345427, now seen corresponding path program 1 times [2024-04-06 22:29:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:21,718 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 22:29:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:21,735 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 22:29:22,012 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:22,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 22:29:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1525777252, now seen corresponding path program 5 times [2024-04-06 22:29:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:22,178 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 22:29:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:22,204 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 22:29:22,744 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:22,745 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 22:29:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1245943147, now seen corresponding path program 13 times [2024-04-06 22:29:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:22,829 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 22:29:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:22,854 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 22:29:23,082 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:23,083 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 22:29:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1372743187, now seen corresponding path program 14 times [2024-04-06 22:29:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:23,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:23,394 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:23,395 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 22:29:23,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2032973603, now seen corresponding path program 15 times [2024-04-06 22:29:23,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:23,486 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 22:29:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:23,505 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 22:29:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-06 22:29:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-06 22:29:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:23,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable87,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable88,SelfDestructingSolverStorable99,SelfDestructingSolverStorable89,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2024-04-06 22:29:23,957 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 22:29:23,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 22:29:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1387107595, now seen corresponding path program 1 times [2024-04-06 22:29:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 22:29:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051449878] [2024-04-06 22:29:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:24,017 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 22:29:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 22:29:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051449878] [2024-04-06 22:29:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051449878] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 22:29:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934401750] [2024-04-06 22:29:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:24,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 22:29:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 22:29:24,034 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 22:29:24,035 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 22:29:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:24,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2024-04-06 22:29:24,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 22:29:24,118 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 22:29:24,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 22:29:24,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 22:29:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934401750] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 22:29:24,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 22:29:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 9 [2024-04-06 22:29:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587268650] [2024-04-06 22:29:24,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 22:29:24,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-06 22:29:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 22:29:24,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-06 22:29:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-04-06 22:29:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:24,154 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 22:29:24,154 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 22:29:24,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 22:29:24,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 22:29:24,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 22:29:24,852 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:24,852 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 22:29:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash 896821661, now seen corresponding path program 13 times [2024-04-06 22:29:24,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:24,988 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 22:29:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:25,017 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 22:29:25,166 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:25,166 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 22:29:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 970235671, now seen corresponding path program 14 times [2024-04-06 22:29:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:25,267 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 22:29:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:25,289 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 22:29:25,759 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:25,760 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 22:29:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -327903914, now seen corresponding path program 6 times [2024-04-06 22:29:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:25,845 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 22:29:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:25,879 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 22:29:26,046 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:26,046 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 22:29:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 275401104, now seen corresponding path program 7 times [2024-04-06 22:29:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:26,139 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 22:29:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:26,159 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 22:29:26,346 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:26,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 37 treesize of output 39 [2024-04-06 22:29:26,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1762063238, now seen corresponding path program 8 times [2024-04-06 22:29:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:26,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:26,621 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:26,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 22:29:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -699910206, now seen corresponding path program 9 times [2024-04-06 22:29:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:26,719 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 22:29:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:26,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:26,765 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 22:29:27,051 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:27,052 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 22:29:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -850775210, now seen corresponding path program 6 times [2024-04-06 22:29:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:27,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 22:29:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 22:29:27,626 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:27,626 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 22:29:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1980492723, now seen corresponding path program 16 times [2024-04-06 22:29:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:27,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:27,734 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 22:29:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:27,782 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 22:29:27,938 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:27,939 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 22:29:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1704662611, now seen corresponding path program 6 times [2024-04-06 22:29:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:28,088 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 22:29:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:28,118 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 22:29:28,353 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:28,354 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 22:29:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2041924923, now seen corresponding path program 17 times [2024-04-06 22:29:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:28,480 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 22:29:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:28,514 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 22:29:28,726 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:28,726 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 22:29:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1218638943, now seen corresponding path program 18 times [2024-04-06 22:29:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 22:29:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-04-06 22:29:29,246 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:29,247 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 22:29:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1890715259, now seen corresponding path program 15 times [2024-04-06 22:29:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:31,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:31,349 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 22:29:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:31,372 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 22:29:31,508 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:31,508 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 22:29:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1488405899, now seen corresponding path program 2 times [2024-04-06 22:29:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:33,831 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 22:29:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 22:29:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 22:29:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 22:29:33,868 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 22:29:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 22:29:33,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-04-06 22:29:34,285 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:34,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 22:29:34,770 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:34,770 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 22:29:35,183 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:35,183 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 22:29:35,578 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:35,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 22:29:36,348 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:36,348 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 22:29:36,677 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:36,678 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 22:29:36,946 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:36,946 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 22:29:37,153 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:37,154 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 22:29:37,478 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:37,479 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 22:29:37,730 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:37,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 37 treesize of output 39 [2024-04-06 22:29:38,378 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:38,379 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 22:29:38,818 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:38,818 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 22:29:39,036 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:39,036 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 22:29:39,270 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:39,271 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 22:29:39,769 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:39,769 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 22:29:40,276 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:40,276 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 22:29:40,561 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:40,561 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 22:29:40,890 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:40,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 30 treesize of output 34 [2024-04-06 22:29:41,208 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:41,208 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 22:29:41,404 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:41,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 22:29:44,098 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:44,098 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 22:29:44,608 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:44,609 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 22:29:44,830 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:44,830 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 22:29:45,158 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:45,158 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 22:29:45,476 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:45,476 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 22:29:45,749 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:45,749 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 22:29:46,057 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:46,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 22:29:46,278 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:46,278 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 22:29:46,527 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:46,528 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 22:29:47,026 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:47,026 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 22:29:47,370 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:47,370 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 22:29:47,618 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:47,618 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 22:29:48,237 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:48,238 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 22:29:49,296 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:49,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 30 treesize of output 34 [2024-04-06 22:29:51,497 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:51,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 22:29:51,953 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:51,953 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 22:29:52,242 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:52,242 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 22:29:52,545 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:52,545 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 22:29:52,894 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:52,894 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 22:29:53,099 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:53,099 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 22:29:53,262 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:53,262 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 22:29:55,545 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:55,545 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 22:29:55,779 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:55,780 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 22:29:56,053 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:56,053 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 22:29:58,269 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:58,269 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 22:29:58,948 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29: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 22:29:59,293 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:59,293 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 22:29:59,491 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-04-06 22:29:59,491 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 22:30:01,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-06 22:30:01,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable126,SelfDestructingSolverStorable105,SelfDestructingSolverStorable127,SelfDestructingSolverStorable106,SelfDestructingSolverStorable128,SelfDestructingSolverStorable107,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-04-06 22:30:01,726 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@74baac18 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 22:30:01,734 INFO L158 Benchmark]: Toolchain (without parser) took 76920.29ms. Allocated memory was 152.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 131.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-04-06 22:30:01,735 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 152.0MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 22:30:01,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.12ms. Allocated memory is still 152.0MB. Free memory was 131.7MB in the beginning and 130.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 22:30:01,736 INFO L158 Benchmark]: Boogie Preprocessor took 16.73ms. Allocated memory is still 152.0MB. Free memory was 130.2MB in the beginning and 129.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 22:30:01,737 INFO L158 Benchmark]: RCFGBuilder took 218.02ms. Allocated memory is still 152.0MB. Free memory was 129.0MB in the beginning and 118.2MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-06 22:30:01,738 INFO L158 Benchmark]: TraceAbstraction took 76659.95ms. Allocated memory was 152.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 117.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-04-06 22:30:01,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 152.0MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.12ms. Allocated memory is still 152.0MB. Free memory was 131.7MB in the beginning and 130.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.73ms. Allocated memory is still 152.0MB. Free memory was 130.2MB in the beginning and 129.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 218.02ms. Allocated memory is still 152.0MB. Free memory was 129.0MB in the beginning and 118.2MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 76659.95ms. Allocated memory was 152.0MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 117.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. 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@74baac18 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@74baac18: 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 22:30:01,763 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 22:30:02,036 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...