java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 22:10:09,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 22:10:09,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 22:10:09,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 22:10:09,029 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 22:10:09,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 22:10:09,031 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 22:10:09,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 22:10:09,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 22:10:09,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 22:10:09,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 22:10:09,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 22:10:09,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 22:10:09,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 22:10:09,040 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 22:10:09,041 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 22:10:09,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 22:10:09,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 22:10:09,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 22:10:09,048 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 22:10:09,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 22:10:09,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 22:10:09,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 22:10:09,054 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 22:10:09,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 22:10:09,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 22:10:09,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 22:10:09,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 22:10:09,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 22:10:09,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 22:10:09,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 22:10:09,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 22:10:09,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 22:10:09,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 22:10:09,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 22:10:09,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 22:10:09,062 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 22:10:09,075 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 22:10:09,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 22:10:09,076 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 22:10:09,076 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 22:10:09,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 22:10:09,077 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 22:10:09,077 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 22:10:09,077 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 22:10:09,077 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 22:10:09,078 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 22:10:09,078 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 22:10:09,078 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 22:10:09,078 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 22:10:09,079 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 22:10:09,079 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 22:10:09,079 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 22:10:09,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 22:10:09,080 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 22:10:09,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 22:10:09,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 22:10:09,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 22:10:09,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 22:10:09,081 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 22:10:09,081 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 22:10:09,081 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 22:10:09,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 22:10:09,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 22:10:09,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 22:10:09,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 22:10:09,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 22:10:09,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:10:09,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 22:10:09,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 22:10:09,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 22:10:09,086 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 22:10:09,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 22:10:09,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 22:10:09,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 22:10:09,086 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 22:10:09,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 22:10:09,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 22:10:09,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 22:10:09,159 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 22:10:09,160 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 22:10:09,161 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2019-01-07 22:10:09,161 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-01-07 22:10:09,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 22:10:09,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 22:10:09,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 22:10:09,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 22:10:09,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 22:10:09,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 22:10:09,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 22:10:09,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 22:10:09,273 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 22:10:09,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... [2019-01-07 22:10:09,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 22:10:09,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 22:10:09,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 22:10:09,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 22:10:09,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:10:09,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 22:10:09,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 22:10:09,574 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 22:10:09,575 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-07 22:10:09,576 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:10:09 BoogieIcfgContainer [2019-01-07 22:10:09,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 22:10:09,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 22:10:09,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 22:10:09,581 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 22:10:09,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:10:09" (1/2) ... [2019-01-07 22:10:09,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d0043e and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 10:10:09, skipping insertion in model container [2019-01-07 22:10:09,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:10:09" (2/2) ... [2019-01-07 22:10:09,584 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-01-07 22:10:09,594 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 22:10:09,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-07 22:10:09,621 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-07 22:10:09,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 22:10:09,655 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 22:10:09,655 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 22:10:09,655 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 22:10:09,656 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 22:10:09,656 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 22:10:09,656 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 22:10:09,656 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 22:10:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-07 22:10:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 22:10:09,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:09,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 22:10:09,681 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-01-07 22:10:09,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:09,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:09,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:09,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:10:09,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:10:09,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:09,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:10:09,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:10:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:10:09,876 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-07 22:10:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:10,044 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-07 22:10:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:10:10,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 22:10:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:10,061 INFO L225 Difference]: With dead ends: 13 [2019-01-07 22:10:10,061 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 22:10:10,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:10:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 22:10:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-01-07 22:10:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 22:10:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-01-07 22:10:10,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-01-07 22:10:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:10,103 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-01-07 22:10:10,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:10:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-01-07 22:10:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:10:10,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:10,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:10:10,104 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-01-07 22:10:10,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:10,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:10,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:10,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:10,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:10,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:10,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:10,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:10:10,212 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-01-07 22:10:10,274 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:10,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:16,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:10:16,114 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:10:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:16,129 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:10:16,386 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 66.67% of their original sizes. [2019-01-07 22:10:16,387 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:10:18,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_55 Int)) (exists ((v_b_95_1 Int) (v_v_976_1 Int) (v_b_94_1 Int) (v_v_978_1 Int) (v_v_975_1 Int) (v_v_974_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_55) (= (select |c_#memory_int| v_idx_55) v_v_974_1)) (<= v_b_95_1 .cse0) (or (<= v_b_94_1 v_idx_57) (< v_idx_57 .cse1) (= (select |c_#memory_int| v_idx_57) v_v_976_1)) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= .cse1 v_b_94_1) (or (= 0 (select |c_#memory_int| v_idx_58)) (< v_idx_58 v_b_94_1) (<= v_b_95_1 v_idx_58)) (<= .cse0 v_b_95_1) (<= 0 (* 2 v_v_975_1)) (or (< v_idx_56 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_56) (= v_v_975_1 (select |c_#memory_int| v_idx_56))) (or (< v_idx_59 v_b_95_1) (= (select |c_#memory_int| v_idx_59) v_v_978_1)) (<= 0 v_v_975_1))))) is different from false [2019-01-07 22:10:20,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_b_95_1 Int) (v_v_976_1 Int) (v_b_94_1 Int) (v_v_978_1 Int) (v_v_975_1 Int) (v_v_974_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_63 v_b_94_1) (<= v_b_95_1 v_idx_63) (= (select |c_#memory_int| v_idx_63) 0)) (<= v_b_95_1 .cse0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= .cse1 v_b_94_1) (<= .cse0 v_b_95_1) (or (<= v_b_94_1 v_idx_62) (= v_v_976_1 (select |c_#memory_int| v_idx_62)) (< v_idx_62 .cse1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_60) (= v_v_974_1 (select |c_#memory_int| v_idx_60))) (<= 0 (* 2 v_v_975_1)) (or (= (select |c_#memory_int| v_idx_61) v_v_975_1) (< v_idx_61 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_61)) (<= 0 v_v_975_1) (or (< v_idx_64 v_b_95_1) (= v_v_978_1 (select |c_#memory_int| v_idx_64))))))) is different from false [2019-01-07 22:10:20,587 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-07 22:10:20,588 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:10:20,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:10:20,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-07 22:10:20,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:20,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:10:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:10:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-07 22:10:20,591 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-01-07 22:10:23,176 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_55 Int)) (exists ((v_b_95_1 Int) (v_v_976_1 Int) (v_b_94_1 Int) (v_v_978_1 Int) (v_v_975_1 Int) (v_v_974_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_55) (= (select |c_#memory_int| v_idx_55) v_v_974_1)) (<= v_b_95_1 .cse0) (or (<= v_b_94_1 v_idx_57) (< v_idx_57 .cse1) (= (select |c_#memory_int| v_idx_57) v_v_976_1)) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= .cse1 v_b_94_1) (or (= 0 (select |c_#memory_int| v_idx_58)) (< v_idx_58 v_b_94_1) (<= v_b_95_1 v_idx_58)) (<= .cse0 v_b_95_1) (<= 0 (* 2 v_v_975_1)) (or (< v_idx_56 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_56) (= v_v_975_1 (select |c_#memory_int| v_idx_56))) (or (< v_idx_59 v_b_95_1) (= (select |c_#memory_int| v_idx_59) v_v_978_1)) (<= 0 v_v_975_1))))) (forall ((v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_b_95_1 Int) (v_v_976_1 Int) (v_b_94_1 Int) (v_v_978_1 Int) (v_v_975_1 Int) (v_v_974_1 Int)) (let ((.cse2 (+ v_b_94_1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_63 v_b_94_1) (<= v_b_95_1 v_idx_63) (= (select |c_#memory_int| v_idx_63) 0)) (<= v_b_95_1 .cse2) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_1) (<= .cse3 v_b_94_1) (<= .cse2 v_b_95_1) (or (<= v_b_94_1 v_idx_62) (= v_v_976_1 (select |c_#memory_int| v_idx_62)) (< v_idx_62 .cse3)) (or (<= c_ULTIMATE.start_main_p1 v_idx_60) (= v_v_974_1 (select |c_#memory_int| v_idx_60))) (<= 0 (* 2 v_v_975_1)) (or (= (select |c_#memory_int| v_idx_61) v_v_975_1) (< v_idx_61 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_61)) (<= 0 v_v_975_1) (or (< v_idx_64 v_b_95_1) (= v_v_978_1 (select |c_#memory_int| v_idx_64)))))))) is different from false [2019-01-07 22:10:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:44,990 INFO L93 Difference]: Finished difference Result 8 states and 13 transitions. [2019-01-07 22:10:44,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:10:44,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:10:44,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:44,992 INFO L225 Difference]: With dead ends: 8 [2019-01-07 22:10:44,992 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 22:10:44,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:10:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 22:10:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 22:10:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 22:10:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-07 22:10:44,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 12 transitions. Word has length 3 [2019-01-07 22:10:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:44,997 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 12 transitions. [2019-01-07 22:10:44,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:10:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 12 transitions. [2019-01-07 22:10:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:10:44,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:44,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:10:44,999 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:10:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-01-07 22:10:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:45,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:45,167 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-07 22:10:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:45,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:45,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:45,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 22:10:45,179 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-01-07 22:10:45,182 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:10:45,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:10:48,229 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:10:48,229 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:10:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:48,230 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:10:48,373 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 58.33% of their original sizes. [2019-01-07 22:10:48,373 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:10:50,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_119 Int) (v_idx_122 Int) (v_idx_123 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_1004_2 Int) (v_v_1000_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (* 2 v_v_1003_2) 0) (or (<= .cse0 v_idx_122) (< v_idx_122 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_122) v_v_1003_2)) (or (= (select |c_#memory_int| v_idx_121) v_v_1002_2) (< v_idx_121 .cse1) (<= c_ULTIMATE.start_main_p2 v_idx_121)) (or (< v_idx_123 .cse0) (= (select |c_#memory_int| v_idx_123) v_v_1004_2)) (or (= (select |c_#memory_int| v_idx_120) 0) (< v_idx_120 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_120)) (<= v_v_1003_2 0) (or (= (select |c_#memory_int| v_idx_119) v_v_1000_2) (<= c_ULTIMATE.start_main_p1 v_idx_119)) (<= .cse1 c_ULTIMATE.start_main_p2))))) is different from false [2019-01-07 22:10:52,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_b_95_2 Int) (v_b_94_2 Int) (v_v_1004_2 Int) (v_v_1000_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_94_2 1))) (and (or (= (select |c_#memory_int| v_idx_128) v_v_1004_2) (< v_idx_128 v_b_95_2)) (<= (* 2 v_v_1003_2) 0) (<= .cse0 v_b_94_2) (<= v_v_1003_2 0) (or (<= c_ULTIMATE.start_main_p1 v_idx_124) (= (select |c_#memory_int| v_idx_124) v_v_1000_2)) (or (= (select |c_#memory_int| v_idx_126) v_v_1002_2) (< v_idx_126 .cse0) (<= v_b_94_2 v_idx_126)) (or (<= .cse0 v_idx_125) (< v_idx_125 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_125))) (<= .cse1 v_b_95_2) (<= v_b_95_2 .cse1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_2) (or (< v_idx_127 v_b_94_2) (<= v_b_95_2 v_idx_127) (= (select |c_#memory_int| v_idx_127) v_v_1003_2)))))) is different from false [2019-01-07 22:10:52,731 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-07 22:10:52,731 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:10:52,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:10:52,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-07 22:10:52,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:10:52,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:10:52,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:10:52,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-07 22:10:52,733 INFO L87 Difference]: Start difference. First operand 7 states and 12 transitions. Second operand 4 states. [2019-01-07 22:10:55,399 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_119 Int) (v_idx_122 Int) (v_idx_123 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_1004_2 Int) (v_v_1000_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (* 2 v_v_1003_2) 0) (or (<= .cse0 v_idx_122) (< v_idx_122 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_122) v_v_1003_2)) (or (= (select |c_#memory_int| v_idx_121) v_v_1002_2) (< v_idx_121 .cse1) (<= c_ULTIMATE.start_main_p2 v_idx_121)) (or (< v_idx_123 .cse0) (= (select |c_#memory_int| v_idx_123) v_v_1004_2)) (or (= (select |c_#memory_int| v_idx_120) 0) (< v_idx_120 c_ULTIMATE.start_main_p1) (<= .cse1 v_idx_120)) (<= v_v_1003_2 0) (or (= (select |c_#memory_int| v_idx_119) v_v_1000_2) (<= c_ULTIMATE.start_main_p1 v_idx_119)) (<= .cse1 c_ULTIMATE.start_main_p2))))) (forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_b_95_2 Int) (v_b_94_2 Int) (v_v_1004_2 Int) (v_v_1000_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ v_b_94_2 1))) (and (or (= (select |c_#memory_int| v_idx_128) v_v_1004_2) (< v_idx_128 v_b_95_2)) (<= (* 2 v_v_1003_2) 0) (<= .cse2 v_b_94_2) (<= v_v_1003_2 0) (or (<= c_ULTIMATE.start_main_p1 v_idx_124) (= (select |c_#memory_int| v_idx_124) v_v_1000_2)) (or (= (select |c_#memory_int| v_idx_126) v_v_1002_2) (< v_idx_126 .cse2) (<= v_b_94_2 v_idx_126)) (or (<= .cse2 v_idx_125) (< v_idx_125 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_125))) (<= .cse3 v_b_95_2) (<= v_b_95_2 .cse3) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_95_2) (or (< v_idx_127 v_b_94_2) (<= v_b_95_2 v_idx_127) (= (select |c_#memory_int| v_idx_127) v_v_1003_2))))))) is different from false [2019-01-07 22:11:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:02,217 INFO L93 Difference]: Finished difference Result 9 states and 16 transitions. [2019-01-07 22:11:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:11:02,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 22:11:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:02,218 INFO L225 Difference]: With dead ends: 9 [2019-01-07 22:11:02,218 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 22:11:02,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:11:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 22:11:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-07 22:11:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 22:11:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-07 22:11:02,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 12 transitions. Word has length 3 [2019-01-07 22:11:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:02,223 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 12 transitions. [2019-01-07 22:11:02,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:11:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 12 transitions. [2019-01-07 22:11:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 22:11:02,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:02,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 22:11:02,224 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-01-07 22:11:02,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:02,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:02,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:02,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:02,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:02,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:11:02,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 22:11:02,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:02,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:11:02,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:11:02,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:11:02,248 INFO L87 Difference]: Start difference. First operand 7 states and 12 transitions. Second operand 3 states. [2019-01-07 22:11:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:02,305 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2019-01-07 22:11:02,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:11:02,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 22:11:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:02,307 INFO L225 Difference]: With dead ends: 9 [2019-01-07 22:11:02,307 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 22:11:02,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:11:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 22:11:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 22:11:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 22:11:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-01-07 22:11:02,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 3 [2019-01-07 22:11:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:02,312 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2019-01-07 22:11:02,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:11:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2019-01-07 22:11:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:11:02,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:02,313 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-07 22:11:02,313 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash 929484, now seen corresponding path program 2 times [2019-01-07 22:11:02,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:02,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:02,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:02,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:02,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:02,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:02,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:02,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:02,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:02,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:02,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:11:02,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:11:02,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 22:11:02,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:02,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:02,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2019-01-07 22:11:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-07 22:11:02,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:02,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:02,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:11:02,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-01-07 22:11:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-07 22:11:02,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:02,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:11:02,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-07 22:11:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:02,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 22:11:02,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:02,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:11:02,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-07 22:11:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:02,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:02,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 22:11:02,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2019-01-07 22:11:02,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:02,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 22:11:02,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 22:11:02,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 22:11:02,900 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2019-01-07 22:11:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:03,051 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. [2019-01-07 22:11:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:11:03,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-07 22:11:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:03,053 INFO L225 Difference]: With dead ends: 14 [2019-01-07 22:11:03,053 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 22:11:03,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 22:11:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 22:11:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2019-01-07 22:11:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 22:11:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2019-01-07 22:11:03,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 22 transitions. Word has length 4 [2019-01-07 22:11:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:03,060 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 22 transitions. [2019-01-07 22:11:03,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 22:11:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 22 transitions. [2019-01-07 22:11:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:11:03,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:03,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:11:03,061 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-01-07 22:11:03,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:03,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:03,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:03,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:03,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:03,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 22:11:03,163 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-01-07 22:11:03,165 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:11:03,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:11:09,691 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:11:09,692 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 22:11:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:09,692 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:11:09,914 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 55.56% of their original sizes. [2019-01-07 22:11:09,914 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:11:12,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_214 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_2709_1)) (or (= (select |c_#memory_int| v_idx_212) v_v_2710_1) (< v_idx_212 .cse0) (<= c_ULTIMATE.start_main_p2 v_idx_212)) (or (= (select |c_#memory_int| v_idx_210) v_v_2708_1) (<= c_ULTIMATE.start_main_p1 v_idx_210)) (or (< v_idx_214 .cse1) (= (select |c_#memory_int| v_idx_214) v_v_2712_1)) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (<= .cse0 c_ULTIMATE.start_main_p2) (or (<= .cse0 v_idx_211) (< v_idx_211 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_211) v_v_2709_1)) (or (<= .cse1 v_idx_213) (< v_idx_213 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_213) v_v_2711_1)))))) is different from false [2019-01-07 22:11:14,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_215 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_217 .cse0) (<= c_ULTIMATE.start_main_p2 v_idx_217) (= (select |c_#memory_int| v_idx_217) v_v_2710_1)) (<= 0 (* 2 v_v_2709_1)) (or (= (select |c_#memory_int| v_idx_215) v_v_2708_1) (<= c_ULTIMATE.start_main_p1 v_idx_215)) (or (= (select |c_#memory_int| v_idx_218) v_v_2711_1) (< v_idx_218 c_ULTIMATE.start_main_p2) (<= .cse1 v_idx_218)) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (or (= (select |c_#memory_int| v_idx_219) v_v_2712_1) (< v_idx_219 .cse1)) (<= .cse0 c_ULTIMATE.start_main_p2) (or (< v_idx_216 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_216) (= (select |c_#memory_int| v_idx_216) v_v_2709_1)))))) is different from false [2019-01-07 22:11:16,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_223 Int) (v_idx_224 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_b_209_1 Int) (v_b_208_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_208_1 1))) (and (<= 0 (* 2 v_v_2709_1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_220) (= (select |c_#memory_int| v_idx_220) v_v_2708_1)) (or (< v_idx_224 v_b_209_1) (= (select |c_#memory_int| v_idx_224) v_v_2712_1)) (or (< v_idx_222 .cse0) (= (select |c_#memory_int| v_idx_222) v_v_2710_1) (<= v_b_208_1 v_idx_222)) (or (= (select |c_#memory_int| v_idx_221) v_v_2709_1) (< v_idx_221 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_221)) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_209_1) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (or (< v_idx_223 v_b_208_1) (<= v_b_209_1 v_idx_223) (= (select |c_#memory_int| v_idx_223) v_v_2711_1)) (<= .cse1 v_b_209_1) (<= .cse0 v_b_208_1) (<= v_b_209_1 .cse1))))) is different from false [2019-01-07 22:11:16,260 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-07 22:11:16,261 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:11:16,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:11:16,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-07 22:11:16,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:16,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 22:11:16,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 22:11:16,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-07 22:11:16,262 INFO L87 Difference]: Start difference. First operand 10 states and 22 transitions. Second operand 5 states. [2019-01-07 22:11:18,510 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_214 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_2709_1)) (or (= (select |c_#memory_int| v_idx_212) v_v_2710_1) (< v_idx_212 .cse0) (<= c_ULTIMATE.start_main_p2 v_idx_212)) (or (= (select |c_#memory_int| v_idx_210) v_v_2708_1) (<= c_ULTIMATE.start_main_p1 v_idx_210)) (or (< v_idx_214 .cse1) (= (select |c_#memory_int| v_idx_214) v_v_2712_1)) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (<= .cse0 c_ULTIMATE.start_main_p2) (or (<= .cse0 v_idx_211) (< v_idx_211 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_211) v_v_2709_1)) (or (<= .cse1 v_idx_213) (< v_idx_213 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_213) v_v_2711_1)))))) (forall ((v_idx_223 Int) (v_idx_224 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_b_209_1 Int) (v_b_208_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ v_b_208_1 1))) (and (<= 0 (* 2 v_v_2709_1)) (or (<= c_ULTIMATE.start_main_p1 v_idx_220) (= (select |c_#memory_int| v_idx_220) v_v_2708_1)) (or (< v_idx_224 v_b_209_1) (= (select |c_#memory_int| v_idx_224) v_v_2712_1)) (or (< v_idx_222 .cse2) (= (select |c_#memory_int| v_idx_222) v_v_2710_1) (<= v_b_208_1 v_idx_222)) (or (= (select |c_#memory_int| v_idx_221) v_v_2709_1) (< v_idx_221 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_221)) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_209_1) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (or (< v_idx_223 v_b_208_1) (<= v_b_209_1 v_idx_223) (= (select |c_#memory_int| v_idx_223) v_v_2711_1)) (<= .cse3 v_b_209_1) (<= .cse2 v_b_208_1) (<= v_b_209_1 .cse3))))) (forall ((v_idx_215 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_217 .cse4) (<= c_ULTIMATE.start_main_p2 v_idx_217) (= (select |c_#memory_int| v_idx_217) v_v_2710_1)) (<= 0 (* 2 v_v_2709_1)) (or (= (select |c_#memory_int| v_idx_215) v_v_2708_1) (<= c_ULTIMATE.start_main_p1 v_idx_215)) (or (= (select |c_#memory_int| v_idx_218) v_v_2711_1) (< v_idx_218 c_ULTIMATE.start_main_p2) (<= .cse5 v_idx_218)) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (or (= (select |c_#memory_int| v_idx_219) v_v_2712_1) (< v_idx_219 .cse5)) (<= .cse4 c_ULTIMATE.start_main_p2) (or (< v_idx_216 c_ULTIMATE.start_main_p1) (<= .cse4 v_idx_216) (= (select |c_#memory_int| v_idx_216) v_v_2709_1))))))) is different from false [2019-01-07 22:11:36,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:36,039 INFO L93 Difference]: Finished difference Result 13 states and 29 transitions. [2019-01-07 22:11:36,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:11:36,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-07 22:11:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:36,040 INFO L225 Difference]: With dead ends: 13 [2019-01-07 22:11:36,040 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 22:11:36,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=9, Invalid=5, Unknown=4, NotChecked=12, Total=30 [2019-01-07 22:11:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 22:11:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-07 22:11:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 22:11:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2019-01-07 22:11:36,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 25 transitions. Word has length 4 [2019-01-07 22:11:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:36,047 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 25 transitions. [2019-01-07 22:11:36,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 22:11:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 25 transitions. [2019-01-07 22:11:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:11:36,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:36,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:11:36,048 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 929672, now seen corresponding path program 1 times [2019-01-07 22:11:36,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:36,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:36,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 22:11:36,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:11:36,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 22:11:36,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:36,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:11:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:11:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 22:11:36,155 INFO L87 Difference]: Start difference. First operand 11 states and 25 transitions. Second operand 4 states. [2019-01-07 22:11:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:36,284 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-07 22:11:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:11:36,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 22:11:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:36,285 INFO L225 Difference]: With dead ends: 14 [2019-01-07 22:11:36,285 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 22:11:36,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 22:11:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 22:11:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 22:11:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 22:11:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2019-01-07 22:11:36,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 26 transitions. Word has length 4 [2019-01-07 22:11:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:36,294 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 26 transitions. [2019-01-07 22:11:36,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:11:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 26 transitions. [2019-01-07 22:11:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:11:36,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:36,295 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-07 22:11:36,296 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:36,296 INFO L82 PathProgramCache]: Analyzing trace with hash 931468, now seen corresponding path program 2 times [2019-01-07 22:11:36,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:36,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:36,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:36,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:36,538 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-07 22:11:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 22:11:36,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:36,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:36,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:36,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:36,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:36,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:36,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:11:36,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:11:36,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 22:11:36,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:36,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:36,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2019-01-07 22:11:36,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-07 22:11:36,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:36,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:36,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:36,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-07 22:11:36,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-07 22:11:36,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:36,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:36,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 22:11:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:36,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-07 22:11:36,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:36,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:11:36,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-07 22:11:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:36,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:36,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:36,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 22:11:36,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:36,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 22:11:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 22:11:36,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-07 22:11:36,841 INFO L87 Difference]: Start difference. First operand 12 states and 26 transitions. Second operand 7 states. [2019-01-07 22:11:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:36,966 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2019-01-07 22:11:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 22:11:36,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-07 22:11:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:36,967 INFO L225 Difference]: With dead ends: 22 [2019-01-07 22:11:36,967 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 22:11:36,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:11:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 22:11:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-01-07 22:11:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 22:11:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2019-01-07 22:11:36,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 34 transitions. Word has length 4 [2019-01-07 22:11:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:36,977 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 34 transitions. [2019-01-07 22:11:36,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 22:11:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 34 transitions. [2019-01-07 22:11:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:11:36,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:36,978 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 22:11:36,978 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:36,978 INFO L82 PathProgramCache]: Analyzing trace with hash 28813922, now seen corresponding path program 2 times [2019-01-07 22:11:36,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:36,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:36,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:36,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:37,180 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-07 22:11:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:37,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:37,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:37,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:37,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:37,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:37,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:37,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:11:37,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:11:37,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 22:11:37,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:37,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:37,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2019-01-07 22:11:37,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-07 22:11:37,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-07 22:11:37,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-07 22:11:37,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 22:11:37,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 22:11:37,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 22:11:37,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:11:37,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 22:11:37,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:37,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:11:37,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-07 22:11:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:37,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:37,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:37,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 22:11:37,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:37,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 22:11:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 22:11:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 22:11:37,587 INFO L87 Difference]: Start difference. First operand 15 states and 34 transitions. Second operand 10 states. [2019-01-07 22:11:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:38,041 INFO L93 Difference]: Finished difference Result 27 states and 58 transitions. [2019-01-07 22:11:38,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 22:11:38,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 22:11:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:38,043 INFO L225 Difference]: With dead ends: 27 [2019-01-07 22:11:38,043 INFO L226 Difference]: Without dead ends: 26 [2019-01-07 22:11:38,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-07 22:11:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-07 22:11:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 7. [2019-01-07 22:11:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 22:11:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-01-07 22:11:38,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2019-01-07 22:11:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:38,051 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2019-01-07 22:11:38,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 22:11:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2019-01-07 22:11:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:11:38,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:38,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:11:38,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:11:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 28815970, now seen corresponding path program 1 times [2019-01-07 22:11:38,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:38,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:38,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:38,241 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-07 22:11:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 22:11:38,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:38,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:38,290 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 22:11:38,290 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-01-07 22:11:38,295 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:11:38,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:11:49,557 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 22:11:49,557 INFO L272 AbstractInterpreter]: Visited 5 different actions 40 times. Merged at 3 different actions 17 times. Widened at 2 different actions 6 times. Found 12 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 22:11:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:49,557 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 22:11:49,960 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 54.17% of their original sizes. [2019-01-07 22:11:49,960 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 22:11:52,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_335 Int) (v_idx_336 Int) (v_idx_333 Int) (v_idx_334 Int) (v_idx_337 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= .cse0 v_idx_336) (< v_idx_336 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_336) v_v_4264_1)) (or (= (select |c_#memory_int| v_idx_333) v_v_4261_1) (<= c_ULTIMATE.start_main_p1 v_idx_333)) (<= v_v_4264_1 v_v_4262_1) (or (<= .cse1 v_idx_334) (= (select |c_#memory_int| v_idx_334) v_v_4262_1) (< v_idx_334 c_ULTIMATE.start_main_p1)) (or (= (select |c_#memory_int| v_idx_337) v_v_4265_1) (< v_idx_337 .cse0)) (<= .cse1 c_ULTIMATE.start_main_p2) (or (< v_idx_335 .cse1) (= (select |c_#memory_int| v_idx_335) v_v_4263_1) (<= c_ULTIMATE.start_main_p2 v_idx_335)) (<= 0 (* 2 v_v_4262_1)) (<= (* 2 v_v_4264_1) 0))))) is different from false [2019-01-07 22:11:55,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_346 Int) (v_idx_347 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_343 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (or (< v_idx_344 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_344) (= (select |c_#memory_int| v_idx_344) v_v_4262_1)) (<= v_v_4264_1 v_v_4262_1) (or (< v_idx_345 .cse0) (= (select |c_#memory_int| v_idx_345) v_v_4263_1) (<= c_ULTIMATE.start_main_p2 v_idx_345)) (or (= (select |c_#memory_int| v_idx_343) v_v_4261_1) (<= c_ULTIMATE.start_main_p1 v_idx_343)) (or (< v_idx_346 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_346) v_v_4264_1) (<= .cse1 v_idx_346)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_4262_1)) (or (= (select |c_#memory_int| v_idx_347) v_v_4265_1) (< v_idx_347 .cse1)) (<= (* 2 v_v_4264_1) 0))))) is different from false [2019-01-07 22:11:57,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_b_297_2 Int) (v_v_4859_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_b_334_1 Int)) (let ((.cse1 (+ v_b_334_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1))) (and (or (<= .cse0 v_idx_351) (< v_idx_351 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_351) v_v_4264_1)) (<= v_b_297_2 .cse1) (or (= (select |c_#memory_int| v_idx_350) v_v_4263_1) (< v_idx_350 v_b_297_2) (<= c_ULTIMATE.start_main_p2 v_idx_350)) (<= v_v_4264_1 v_v_4859_1) (<= v_b_297_2 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_349) v_v_4859_1) (< v_idx_349 v_b_334_1) (<= v_b_297_2 v_idx_349)) (<= .cse1 c_ULTIMATE.start_main_p2) (<= .cse1 v_b_297_2) (<= (* 2 v_v_4264_1) 0) (or (<= v_b_334_1 v_idx_348) (= (select |c_#memory_int| v_idx_348) v_v_4261_1)) (<= 0 (* 2 v_v_4859_1)) (or (= (select |c_#memory_int| v_idx_352) v_v_4265_1) (< v_idx_352 .cse0)))))) is different from false [2019-01-07 22:11:58,861 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-07 22:11:58,861 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 22:11:58,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 22:11:58,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2019-01-07 22:11:58,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:11:58,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 22:11:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 22:11:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=6, Unknown=3, NotChecked=12, Total=30 [2019-01-07 22:11:58,862 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2019-01-07 22:12:01,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_346 Int) (v_idx_347 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_343 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (or (< v_idx_344 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_344) (= (select |c_#memory_int| v_idx_344) v_v_4262_1)) (<= v_v_4264_1 v_v_4262_1) (or (< v_idx_345 .cse0) (= (select |c_#memory_int| v_idx_345) v_v_4263_1) (<= c_ULTIMATE.start_main_p2 v_idx_345)) (or (= (select |c_#memory_int| v_idx_343) v_v_4261_1) (<= c_ULTIMATE.start_main_p1 v_idx_343)) (or (< v_idx_346 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_346) v_v_4264_1) (<= .cse1 v_idx_346)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_4262_1)) (or (= (select |c_#memory_int| v_idx_347) v_v_4265_1) (< v_idx_347 .cse1)) (<= (* 2 v_v_4264_1) 0))))) (forall ((v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_b_297_2 Int) (v_v_4859_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_b_334_1 Int)) (let ((.cse3 (+ v_b_334_1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1))) (and (or (<= .cse2 v_idx_351) (< v_idx_351 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_351) v_v_4264_1)) (<= v_b_297_2 .cse3) (or (= (select |c_#memory_int| v_idx_350) v_v_4263_1) (< v_idx_350 v_b_297_2) (<= c_ULTIMATE.start_main_p2 v_idx_350)) (<= v_v_4264_1 v_v_4859_1) (<= v_b_297_2 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_349) v_v_4859_1) (< v_idx_349 v_b_334_1) (<= v_b_297_2 v_idx_349)) (<= .cse3 c_ULTIMATE.start_main_p2) (<= .cse3 v_b_297_2) (<= (* 2 v_v_4264_1) 0) (or (<= v_b_334_1 v_idx_348) (= (select |c_#memory_int| v_idx_348) v_v_4261_1)) (<= 0 (* 2 v_v_4859_1)) (or (= (select |c_#memory_int| v_idx_352) v_v_4265_1) (< v_idx_352 .cse2)))))) (forall ((v_idx_335 Int) (v_idx_336 Int) (v_idx_333 Int) (v_idx_334 Int) (v_idx_337 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p2 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= .cse4 v_idx_336) (< v_idx_336 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_336) v_v_4264_1)) (or (= (select |c_#memory_int| v_idx_333) v_v_4261_1) (<= c_ULTIMATE.start_main_p1 v_idx_333)) (<= v_v_4264_1 v_v_4262_1) (or (<= .cse5 v_idx_334) (= (select |c_#memory_int| v_idx_334) v_v_4262_1) (< v_idx_334 c_ULTIMATE.start_main_p1)) (or (= (select |c_#memory_int| v_idx_337) v_v_4265_1) (< v_idx_337 .cse4)) (<= .cse5 c_ULTIMATE.start_main_p2) (or (< v_idx_335 .cse5) (= (select |c_#memory_int| v_idx_335) v_v_4263_1) (<= c_ULTIMATE.start_main_p2 v_idx_335)) (<= 0 (* 2 v_v_4262_1)) (<= (* 2 v_v_4264_1) 0))))) (forall ((v_idx_339 Int) (v_idx_338 Int) (v_idx_342 Int) (v_idx_340 Int) (v_idx_341 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (+ c_ULTIMATE.start_main_p2 1))) (and (or (= (select |c_#memory_int| v_idx_342) v_v_4265_1) (< v_idx_342 .cse6)) (<= v_v_4264_1 v_v_4262_1) (or (= (select |c_#memory_int| v_idx_339) v_v_4262_1) (< v_idx_339 c_ULTIMATE.start_main_p1) (<= .cse7 v_idx_339)) (or (= (select |c_#memory_int| v_idx_340) v_v_4263_1) (< v_idx_340 .cse7) (<= c_ULTIMATE.start_main_p2 v_idx_340)) (<= .cse7 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_341) v_v_4264_1) (<= .cse6 v_idx_341) (< v_idx_341 c_ULTIMATE.start_main_p2)) (<= 0 (* 2 v_v_4262_1)) (<= (* 2 v_v_4264_1) 0) (or (= (select |c_#memory_int| v_idx_338) v_v_4261_1) (<= c_ULTIMATE.start_main_p1 v_idx_338))))))) is different from false [2019-01-07 22:12:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:16,489 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-07 22:12:16,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:12:16,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-07 22:12:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:16,490 INFO L225 Difference]: With dead ends: 11 [2019-01-07 22:12:16,490 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 22:12:16,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=11, Invalid=7, Unknown=4, NotChecked=20, Total=42 [2019-01-07 22:12:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 22:12:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-07 22:12:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 22:12:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-07 22:12:16,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 5 [2019-01-07 22:12:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:16,499 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-07 22:12:16,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 22:12:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-07 22:12:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:12:16,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:16,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:12:16,500 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:12:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 2 times [2019-01-07 22:12:16,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:16,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:16,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:16,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:16,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:16,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:16,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:16,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:16,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:16,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:16,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:12:16,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:12:16,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 22:12:16,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:12:16,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:16,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2019-01-07 22:12:16,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-07 22:12:16,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:16,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:16,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:16,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-01-07 22:12:16,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-07 22:12:16,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:16,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:16,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 22:12:16,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 22:12:16,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 22:12:16,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:16,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 22:12:16,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-07 22:12:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:16,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-07 22:12:16,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:16,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 22:12:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 22:12:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:12:16,858 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 9 states. [2019-01-07 22:12:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:16,967 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2019-01-07 22:12:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 22:12:16,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-07 22:12:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:16,968 INFO L225 Difference]: With dead ends: 11 [2019-01-07 22:12:16,969 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 22:12:16,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-07 22:12:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 22:12:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 22:12:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 22:12:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 22:12:16,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-07 22:12:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:16,971 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 22:12:16,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 22:12:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 22:12:16,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 22:12:16,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 22:17:16,583 WARN L181 SmtUtils]: Spent 4.99 m on a formula simplification. DAG size of input: 469 DAG size of output: 440 [2019-01-07 22:17:16,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-07 22:17:16,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-07 22:17:16,591 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (let ((.cse23 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse8 (forall ((v_idx_215 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse25 (+ ULTIMATE.start_main_p2 1)) (.cse24 (+ ULTIMATE.start_main_p1 1))) (and (or (< v_idx_217 .cse24) (<= ULTIMATE.start_main_p2 v_idx_217) (= (select |#memory_int| v_idx_217) v_v_2710_1)) (<= 0 (* 2 v_v_2709_1)) (or (= (select |#memory_int| v_idx_215) v_v_2708_1) (<= ULTIMATE.start_main_p1 v_idx_215)) (or (= (select |#memory_int| v_idx_218) v_v_2711_1) (< v_idx_218 ULTIMATE.start_main_p2) (<= .cse25 v_idx_218)) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (or (= (select |#memory_int| v_idx_219) v_v_2712_1) (< v_idx_219 .cse25)) (<= .cse24 ULTIMATE.start_main_p2) (or (< v_idx_216 ULTIMATE.start_main_p1) (<= .cse24 v_idx_216) (= (select |#memory_int| v_idx_216) v_v_2709_1))))))) (.cse21 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse22 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse23 1)) ULTIMATE.start_main_p2))) (or (and (forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_55 Int)) (exists ((v_b_95_1 Int) (v_v_976_1 Int) (v_b_94_1 Int) (v_v_978_1 Int) (v_v_975_1 Int) (v_v_974_1 Int)) (let ((.cse0 (+ v_b_94_1 1)) (.cse1 (+ ULTIMATE.start_main_p1 1))) (and (or (<= ULTIMATE.start_main_p1 v_idx_55) (= (select |#memory_int| v_idx_55) v_v_974_1)) (<= v_b_95_1 .cse0) (or (<= v_b_94_1 v_idx_57) (< v_idx_57 .cse1) (= (select |#memory_int| v_idx_57) v_v_976_1)) (<= (+ ULTIMATE.start_main_p1 2) v_b_95_1) (<= .cse1 v_b_94_1) (or (= 0 (select |#memory_int| v_idx_58)) (< v_idx_58 v_b_94_1) (<= v_b_95_1 v_idx_58)) (<= .cse0 v_b_95_1) (<= 0 (* 2 v_v_975_1)) (or (< v_idx_56 ULTIMATE.start_main_p1) (<= .cse1 v_idx_56) (= v_v_975_1 (select |#memory_int| v_idx_56))) (or (< v_idx_59 v_b_95_1) (= (select |#memory_int| v_idx_59) v_v_978_1)) (<= 0 v_v_975_1))))) (forall ((v_idx_119 Int) (v_idx_122 Int) (v_idx_123 Int) (v_idx_120 Int) (v_idx_121 Int)) (exists ((v_v_1004_2 Int) (v_v_1000_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int)) (let ((.cse2 (+ ULTIMATE.start_main_p2 1)) (.cse3 (+ ULTIMATE.start_main_p1 1))) (and (<= (* 2 v_v_1003_2) 0) (or (<= .cse2 v_idx_122) (< v_idx_122 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_122) v_v_1003_2)) (or (= (select |#memory_int| v_idx_121) v_v_1002_2) (< v_idx_121 .cse3) (<= ULTIMATE.start_main_p2 v_idx_121)) (or (< v_idx_123 .cse2) (= (select |#memory_int| v_idx_123) v_v_1004_2)) (or (= (select |#memory_int| v_idx_120) 0) (< v_idx_120 ULTIMATE.start_main_p1) (<= .cse3 v_idx_120)) (<= v_v_1003_2 0) (or (= (select |#memory_int| v_idx_119) v_v_1000_2) (<= ULTIMATE.start_main_p1 v_idx_119)) (<= .cse3 ULTIMATE.start_main_p2))))) (forall ((v_idx_214 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_210 Int) (v_idx_211 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse4 (+ ULTIMATE.start_main_p1 1)) (.cse5 (+ ULTIMATE.start_main_p2 1))) (and (<= 0 (* 2 v_v_2709_1)) (or (= (select |#memory_int| v_idx_212) v_v_2710_1) (< v_idx_212 .cse4) (<= ULTIMATE.start_main_p2 v_idx_212)) (or (= (select |#memory_int| v_idx_210) v_v_2708_1) (<= ULTIMATE.start_main_p1 v_idx_210)) (or (< v_idx_214 .cse5) (= (select |#memory_int| v_idx_214) v_v_2712_1)) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (<= .cse4 ULTIMATE.start_main_p2) (or (<= .cse4 v_idx_211) (< v_idx_211 ULTIMATE.start_main_p1) (= (select |#memory_int| v_idx_211) v_v_2709_1)) (or (<= .cse5 v_idx_213) (< v_idx_213 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_213) v_v_2711_1)))))) (forall ((v_idx_346 Int) (v_idx_347 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_343 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse6 (+ ULTIMATE.start_main_p1 1)) (.cse7 (+ ULTIMATE.start_main_p2 1))) (and (or (< v_idx_344 ULTIMATE.start_main_p1) (<= .cse6 v_idx_344) (= (select |#memory_int| v_idx_344) v_v_4262_1)) (<= v_v_4264_1 v_v_4262_1) (or (< v_idx_345 .cse6) (= (select |#memory_int| v_idx_345) v_v_4263_1) (<= ULTIMATE.start_main_p2 v_idx_345)) (or (= (select |#memory_int| v_idx_343) v_v_4261_1) (<= ULTIMATE.start_main_p1 v_idx_343)) (or (< v_idx_346 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_346) v_v_4264_1) (<= .cse7 v_idx_346)) (<= .cse6 ULTIMATE.start_main_p2) (<= 0 (* 2 v_v_4262_1)) (or (= (select |#memory_int| v_idx_347) v_v_4265_1) (< v_idx_347 .cse7)) (<= (* 2 v_v_4264_1) 0))))) .cse8 (forall ((v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_b_95_1 Int) (v_v_976_1 Int) (v_b_94_1 Int) (v_v_978_1 Int) (v_v_975_1 Int) (v_v_974_1 Int)) (let ((.cse9 (+ v_b_94_1 1)) (.cse10 (+ ULTIMATE.start_main_p1 1))) (and (or (< v_idx_63 v_b_94_1) (<= v_b_95_1 v_idx_63) (= (select |#memory_int| v_idx_63) 0)) (<= v_b_95_1 .cse9) (<= (+ ULTIMATE.start_main_p1 2) v_b_95_1) (<= .cse10 v_b_94_1) (<= .cse9 v_b_95_1) (or (<= v_b_94_1 v_idx_62) (= v_v_976_1 (select |#memory_int| v_idx_62)) (< v_idx_62 .cse10)) (or (<= ULTIMATE.start_main_p1 v_idx_60) (= v_v_974_1 (select |#memory_int| v_idx_60))) (<= 0 (* 2 v_v_975_1)) (or (= (select |#memory_int| v_idx_61) v_v_975_1) (< v_idx_61 ULTIMATE.start_main_p1) (<= .cse10 v_idx_61)) (<= 0 v_v_975_1) (or (< v_idx_64 v_b_95_1) (= v_v_978_1 (select |#memory_int| v_idx_64))))))) (forall ((v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_b_297_2 Int) (v_v_4859_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_b_334_1 Int)) (let ((.cse12 (+ v_b_334_1 1)) (.cse11 (+ ULTIMATE.start_main_p2 1))) (and (or (<= .cse11 v_idx_351) (< v_idx_351 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_351) v_v_4264_1)) (<= v_b_297_2 .cse12) (or (= (select |#memory_int| v_idx_350) v_v_4263_1) (< v_idx_350 v_b_297_2) (<= ULTIMATE.start_main_p2 v_idx_350)) (<= v_v_4264_1 v_v_4859_1) (<= v_b_297_2 ULTIMATE.start_main_p2) (or (= (select |#memory_int| v_idx_349) v_v_4859_1) (< v_idx_349 v_b_334_1) (<= v_b_297_2 v_idx_349)) (<= .cse12 ULTIMATE.start_main_p2) (<= .cse12 v_b_297_2) (<= (* 2 v_v_4264_1) 0) (or (<= v_b_334_1 v_idx_348) (= (select |#memory_int| v_idx_348) v_v_4261_1)) (<= 0 (* 2 v_v_4859_1)) (or (= (select |#memory_int| v_idx_352) v_v_4265_1) (< v_idx_352 .cse11)))))) (forall ((v_idx_223 Int) (v_idx_224 Int) (v_idx_221 Int) (v_idx_222 Int) (v_idx_220 Int)) (exists ((v_v_2708_1 Int) (v_v_2709_1 Int) (v_b_209_1 Int) (v_b_208_1 Int) (v_v_2710_1 Int) (v_v_2711_1 Int) (v_v_2712_1 Int)) (let ((.cse13 (+ ULTIMATE.start_main_p1 1)) (.cse14 (+ v_b_208_1 1))) (and (<= 0 (* 2 v_v_2709_1)) (or (<= ULTIMATE.start_main_p1 v_idx_220) (= (select |#memory_int| v_idx_220) v_v_2708_1)) (or (< v_idx_224 v_b_209_1) (= (select |#memory_int| v_idx_224) v_v_2712_1)) (or (< v_idx_222 .cse13) (= (select |#memory_int| v_idx_222) v_v_2710_1) (<= v_b_208_1 v_idx_222)) (or (= (select |#memory_int| v_idx_221) v_v_2709_1) (< v_idx_221 ULTIMATE.start_main_p1) (<= .cse13 v_idx_221)) (<= (+ ULTIMATE.start_main_p1 2) v_b_209_1) (<= (* 2 v_v_2711_1) 0) (<= v_v_2711_1 v_v_2709_1) (or (< v_idx_223 v_b_208_1) (<= v_b_209_1 v_idx_223) (= (select |#memory_int| v_idx_223) v_v_2711_1)) (<= .cse14 v_b_209_1) (<= .cse13 v_b_208_1) (<= v_b_209_1 .cse14))))) (forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_b_95_2 Int) (v_b_94_2 Int) (v_v_1004_2 Int) (v_v_1000_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int)) (let ((.cse15 (+ ULTIMATE.start_main_p1 1)) (.cse16 (+ v_b_94_2 1))) (and (or (= (select |#memory_int| v_idx_128) v_v_1004_2) (< v_idx_128 v_b_95_2)) (<= (* 2 v_v_1003_2) 0) (<= .cse15 v_b_94_2) (<= v_v_1003_2 0) (or (<= ULTIMATE.start_main_p1 v_idx_124) (= (select |#memory_int| v_idx_124) v_v_1000_2)) (or (= (select |#memory_int| v_idx_126) v_v_1002_2) (< v_idx_126 .cse15) (<= v_b_94_2 v_idx_126)) (or (<= .cse15 v_idx_125) (< v_idx_125 ULTIMATE.start_main_p1) (= 0 (select |#memory_int| v_idx_125))) (<= .cse16 v_b_95_2) (<= v_b_95_2 .cse16) (<= (+ ULTIMATE.start_main_p1 2) v_b_95_2) (or (< v_idx_127 v_b_94_2) (<= v_b_95_2 v_idx_127) (= (select |#memory_int| v_idx_127) v_v_1003_2)))))) (forall ((v_idx_335 Int) (v_idx_336 Int) (v_idx_333 Int) (v_idx_334 Int) (v_idx_337 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse17 (+ ULTIMATE.start_main_p2 1)) (.cse18 (+ ULTIMATE.start_main_p1 1))) (and (or (<= .cse17 v_idx_336) (< v_idx_336 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_336) v_v_4264_1)) (or (= (select |#memory_int| v_idx_333) v_v_4261_1) (<= ULTIMATE.start_main_p1 v_idx_333)) (<= v_v_4264_1 v_v_4262_1) (or (<= .cse18 v_idx_334) (= (select |#memory_int| v_idx_334) v_v_4262_1) (< v_idx_334 ULTIMATE.start_main_p1)) (or (= (select |#memory_int| v_idx_337) v_v_4265_1) (< v_idx_337 .cse17)) (<= .cse18 ULTIMATE.start_main_p2) (or (< v_idx_335 .cse18) (= (select |#memory_int| v_idx_335) v_v_4263_1) (<= ULTIMATE.start_main_p2 v_idx_335)) (<= 0 (* 2 v_v_4262_1)) (<= (* 2 v_v_4264_1) 0))))) (forall ((v_idx_339 Int) (v_idx_338 Int) (v_idx_342 Int) (v_idx_340 Int) (v_idx_341 Int)) (exists ((v_v_4265_1 Int) (v_v_4264_1 Int) (v_v_4261_1 Int) (v_v_4263_1 Int) (v_v_4262_1 Int)) (let ((.cse20 (+ ULTIMATE.start_main_p1 1)) (.cse19 (+ ULTIMATE.start_main_p2 1))) (and (or (= (select |#memory_int| v_idx_342) v_v_4265_1) (< v_idx_342 .cse19)) (<= v_v_4264_1 v_v_4262_1) (or (= (select |#memory_int| v_idx_339) v_v_4262_1) (< v_idx_339 ULTIMATE.start_main_p1) (<= .cse20 v_idx_339)) (or (= (select |#memory_int| v_idx_340) v_v_4263_1) (< v_idx_340 .cse20) (<= ULTIMATE.start_main_p2 v_idx_340)) (<= .cse20 ULTIMATE.start_main_p2) (or (= (select |#memory_int| v_idx_341) v_v_4264_1) (<= .cse19 v_idx_341) (< v_idx_341 ULTIMATE.start_main_p2)) (<= 0 (* 2 v_v_4262_1)) (<= (* 2 v_v_4264_1) 0) (or (= (select |#memory_int| v_idx_338) v_v_4261_1) (<= ULTIMATE.start_main_p1 v_idx_338))))))) (or (and (<= 2 .cse21) (= 0 .cse22)) (and (= .cse23 1) .cse8)) (and (or (<= 1 .cse23) (= 0 .cse21)) (<= (+ .cse22 1) 0))))) [2019-01-07 22:17:16,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-01-07 22:17:16,591 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-01-07 22:17:16,591 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-01-07 22:17:16,591 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-07 22:17:16,619 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 10:17:16 BoogieIcfgContainer [2019-01-07 22:17:16,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 22:17:16,620 INFO L168 Benchmark]: Toolchain (without parser) took 427411.64 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -457.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-01-07 22:17:16,620 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:17:16,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:17:16,621 INFO L168 Benchmark]: Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 22:17:16,622 INFO L168 Benchmark]: RCFGBuilder took 277.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 22:17:16,622 INFO L168 Benchmark]: TraceAbstraction took 427041.81 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -479.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-01-07 22:17:16,625 INFO L336 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 277.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 427041.81 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -479.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((((((forall v_idx_58 : int, v_idx_59 : int, v_idx_56 : int, v_idx_57 : int, v_idx_55 : int :: (exists v_b_95_1 : int, v_v_976_1 : int, v_b_94_1 : int, v_v_978_1 : int, v_v_975_1 : int, v_v_974_1 : int :: ((((((((((p1 <= v_idx_55 || #memory_int[v_idx_55] == v_v_974_1) && v_b_95_1 <= v_b_94_1 + 1) && ((v_b_94_1 <= v_idx_57 || v_idx_57 < p1 + 1) || #memory_int[v_idx_57] == v_v_976_1)) && p1 + 2 <= v_b_95_1) && p1 + 1 <= v_b_94_1) && ((0 == #memory_int[v_idx_58] || v_idx_58 < v_b_94_1) || v_b_95_1 <= v_idx_58)) && v_b_94_1 + 1 <= v_b_95_1) && 0 <= 2 * v_v_975_1) && ((v_idx_56 < p1 || p1 + 1 <= v_idx_56) || v_v_975_1 == #memory_int[v_idx_56])) && (v_idx_59 < v_b_95_1 || #memory_int[v_idx_59] == v_v_978_1)) && 0 <= v_v_975_1)) && (forall v_idx_119 : int, v_idx_122 : int, v_idx_123 : int, v_idx_120 : int, v_idx_121 : int :: (exists v_v_1004_2 : int, v_v_1000_2 : int, v_v_1002_2 : int, v_v_1003_2 : int :: ((((((2 * v_v_1003_2 <= 0 && ((p2 + 1 <= v_idx_122 || v_idx_122 < p2) || #memory_int[v_idx_122] == v_v_1003_2)) && ((#memory_int[v_idx_121] == v_v_1002_2 || v_idx_121 < p1 + 1) || p2 <= v_idx_121)) && (v_idx_123 < p2 + 1 || #memory_int[v_idx_123] == v_v_1004_2)) && ((#memory_int[v_idx_120] == 0 || v_idx_120 < p1) || p1 + 1 <= v_idx_120)) && v_v_1003_2 <= 0) && (#memory_int[v_idx_119] == v_v_1000_2 || p1 <= v_idx_119)) && p1 + 1 <= p2))) && (forall v_idx_214 : int, v_idx_212 : int, v_idx_213 : int, v_idx_210 : int, v_idx_211 : int :: (exists v_v_2708_1 : int, v_v_2709_1 : int, v_v_2710_1 : int, v_v_2711_1 : int, v_v_2712_1 : int :: (((((((0 <= 2 * v_v_2709_1 && ((#memory_int[v_idx_212] == v_v_2710_1 || v_idx_212 < p1 + 1) || p2 <= v_idx_212)) && (#memory_int[v_idx_210] == v_v_2708_1 || p1 <= v_idx_210)) && (v_idx_214 < p2 + 1 || #memory_int[v_idx_214] == v_v_2712_1)) && 2 * v_v_2711_1 <= 0) && v_v_2711_1 <= v_v_2709_1) && p1 + 1 <= p2) && ((p1 + 1 <= v_idx_211 || v_idx_211 < p1) || #memory_int[v_idx_211] == v_v_2709_1)) && ((p2 + 1 <= v_idx_213 || v_idx_213 < p2) || #memory_int[v_idx_213] == v_v_2711_1)))) && (forall v_idx_346 : int, v_idx_347 : int, v_idx_344 : int, v_idx_345 : int, v_idx_343 : int :: (exists v_v_4265_1 : int, v_v_4264_1 : int, v_v_4261_1 : int, v_v_4263_1 : int, v_v_4262_1 : int :: (((((((((v_idx_344 < p1 || p1 + 1 <= v_idx_344) || #memory_int[v_idx_344] == v_v_4262_1) && v_v_4264_1 <= v_v_4262_1) && ((v_idx_345 < p1 + 1 || #memory_int[v_idx_345] == v_v_4263_1) || p2 <= v_idx_345)) && (#memory_int[v_idx_343] == v_v_4261_1 || p1 <= v_idx_343)) && ((v_idx_346 < p2 || #memory_int[v_idx_346] == v_v_4264_1) || p2 + 1 <= v_idx_346)) && p1 + 1 <= p2) && 0 <= 2 * v_v_4262_1) && (#memory_int[v_idx_347] == v_v_4265_1 || v_idx_347 < p2 + 1)) && 2 * v_v_4264_1 <= 0))) && (forall v_idx_215 : int, v_idx_218 : int, v_idx_219 : int, v_idx_216 : int, v_idx_217 : int :: (exists v_v_2708_1 : int, v_v_2709_1 : int, v_v_2710_1 : int, v_v_2711_1 : int, v_v_2712_1 : int :: (((((((((v_idx_217 < p1 + 1 || p2 <= v_idx_217) || #memory_int[v_idx_217] == v_v_2710_1) && 0 <= 2 * v_v_2709_1) && (#memory_int[v_idx_215] == v_v_2708_1 || p1 <= v_idx_215)) && ((#memory_int[v_idx_218] == v_v_2711_1 || v_idx_218 < p2) || p2 + 1 <= v_idx_218)) && 2 * v_v_2711_1 <= 0) && v_v_2711_1 <= v_v_2709_1) && (#memory_int[v_idx_219] == v_v_2712_1 || v_idx_219 < p2 + 1)) && p1 + 1 <= p2) && ((v_idx_216 < p1 || p1 + 1 <= v_idx_216) || #memory_int[v_idx_216] == v_v_2709_1)))) && (forall v_idx_63 : int, v_idx_64 : int, v_idx_61 : int, v_idx_62 : int, v_idx_60 : int :: (exists v_b_95_1 : int, v_v_976_1 : int, v_b_94_1 : int, v_v_978_1 : int, v_v_975_1 : int, v_v_974_1 : int :: (((((((((((v_idx_63 < v_b_94_1 || v_b_95_1 <= v_idx_63) || #memory_int[v_idx_63] == 0) && v_b_95_1 <= v_b_94_1 + 1) && p1 + 2 <= v_b_95_1) && p1 + 1 <= v_b_94_1) && v_b_94_1 + 1 <= v_b_95_1) && ((v_b_94_1 <= v_idx_62 || v_v_976_1 == #memory_int[v_idx_62]) || v_idx_62 < p1 + 1)) && (p1 <= v_idx_60 || v_v_974_1 == #memory_int[v_idx_60])) && 0 <= 2 * v_v_975_1) && ((#memory_int[v_idx_61] == v_v_975_1 || v_idx_61 < p1) || p1 + 1 <= v_idx_61)) && 0 <= v_v_975_1) && (v_idx_64 < v_b_95_1 || v_v_978_1 == #memory_int[v_idx_64])))) && (forall v_idx_348 : int, v_idx_349 : int, v_idx_350 : int, v_idx_351 : int, v_idx_352 : int :: (exists v_v_4265_1 : int, v_v_4264_1 : int, v_b_297_2 : int, v_v_4859_1 : int, v_v_4261_1 : int, v_v_4263_1 : int, v_b_334_1 : int :: ((((((((((((p2 + 1 <= v_idx_351 || v_idx_351 < p2) || #memory_int[v_idx_351] == v_v_4264_1) && v_b_297_2 <= v_b_334_1 + 1) && ((#memory_int[v_idx_350] == v_v_4263_1 || v_idx_350 < v_b_297_2) || p2 <= v_idx_350)) && v_v_4264_1 <= v_v_4859_1) && v_b_297_2 <= p2) && ((#memory_int[v_idx_349] == v_v_4859_1 || v_idx_349 < v_b_334_1) || v_b_297_2 <= v_idx_349)) && v_b_334_1 + 1 <= p2) && v_b_334_1 + 1 <= v_b_297_2) && 2 * v_v_4264_1 <= 0) && (v_b_334_1 <= v_idx_348 || #memory_int[v_idx_348] == v_v_4261_1)) && 0 <= 2 * v_v_4859_1) && (#memory_int[v_idx_352] == v_v_4265_1 || v_idx_352 < p2 + 1)))) && (forall v_idx_223 : int, v_idx_224 : int, v_idx_221 : int, v_idx_222 : int, v_idx_220 : int :: (exists v_v_2708_1 : int, v_v_2709_1 : int, v_b_209_1 : int, v_b_208_1 : int, v_v_2710_1 : int, v_v_2711_1 : int, v_v_2712_1 : int :: ((((((((((0 <= 2 * v_v_2709_1 && (p1 <= v_idx_220 || #memory_int[v_idx_220] == v_v_2708_1)) && (v_idx_224 < v_b_209_1 || #memory_int[v_idx_224] == v_v_2712_1)) && ((v_idx_222 < p1 + 1 || #memory_int[v_idx_222] == v_v_2710_1) || v_b_208_1 <= v_idx_222)) && ((#memory_int[v_idx_221] == v_v_2709_1 || v_idx_221 < p1) || p1 + 1 <= v_idx_221)) && p1 + 2 <= v_b_209_1) && 2 * v_v_2711_1 <= 0) && v_v_2711_1 <= v_v_2709_1) && ((v_idx_223 < v_b_208_1 || v_b_209_1 <= v_idx_223) || #memory_int[v_idx_223] == v_v_2711_1)) && v_b_208_1 + 1 <= v_b_209_1) && p1 + 1 <= v_b_208_1) && v_b_209_1 <= v_b_208_1 + 1))) && (forall v_idx_126 : int, v_idx_127 : int, v_idx_124 : int, v_idx_125 : int, v_idx_128 : int :: (exists v_b_95_2 : int, v_b_94_2 : int, v_v_1004_2 : int, v_v_1000_2 : int, v_v_1002_2 : int, v_v_1003_2 : int :: ((((((((((#memory_int[v_idx_128] == v_v_1004_2 || v_idx_128 < v_b_95_2) && 2 * v_v_1003_2 <= 0) && p1 + 1 <= v_b_94_2) && v_v_1003_2 <= 0) && (p1 <= v_idx_124 || #memory_int[v_idx_124] == v_v_1000_2)) && ((#memory_int[v_idx_126] == v_v_1002_2 || v_idx_126 < p1 + 1) || v_b_94_2 <= v_idx_126)) && ((p1 + 1 <= v_idx_125 || v_idx_125 < p1) || 0 == #memory_int[v_idx_125])) && v_b_94_2 + 1 <= v_b_95_2) && v_b_95_2 <= v_b_94_2 + 1) && p1 + 2 <= v_b_95_2) && ((v_idx_127 < v_b_94_2 || v_b_95_2 <= v_idx_127) || #memory_int[v_idx_127] == v_v_1003_2)))) && (forall v_idx_335 : int, v_idx_336 : int, v_idx_333 : int, v_idx_334 : int, v_idx_337 : int :: (exists v_v_4265_1 : int, v_v_4264_1 : int, v_v_4261_1 : int, v_v_4263_1 : int, v_v_4262_1 : int :: (((((((((p2 + 1 <= v_idx_336 || v_idx_336 < p2) || #memory_int[v_idx_336] == v_v_4264_1) && (#memory_int[v_idx_333] == v_v_4261_1 || p1 <= v_idx_333)) && v_v_4264_1 <= v_v_4262_1) && ((p1 + 1 <= v_idx_334 || #memory_int[v_idx_334] == v_v_4262_1) || v_idx_334 < p1)) && (#memory_int[v_idx_337] == v_v_4265_1 || v_idx_337 < p2 + 1)) && p1 + 1 <= p2) && ((v_idx_335 < p1 + 1 || #memory_int[v_idx_335] == v_v_4263_1) || p2 <= v_idx_335)) && 0 <= 2 * v_v_4262_1) && 2 * v_v_4264_1 <= 0))) && (forall v_idx_339 : int, v_idx_338 : int, v_idx_342 : int, v_idx_340 : int, v_idx_341 : int :: (exists v_v_4265_1 : int, v_v_4264_1 : int, v_v_4261_1 : int, v_v_4263_1 : int, v_v_4262_1 : int :: ((((((((#memory_int[v_idx_342] == v_v_4265_1 || v_idx_342 < p2 + 1) && v_v_4264_1 <= v_v_4262_1) && ((#memory_int[v_idx_339] == v_v_4262_1 || v_idx_339 < p1) || p1 + 1 <= v_idx_339)) && ((#memory_int[v_idx_340] == v_v_4263_1 || v_idx_340 < p1 + 1) || p2 <= v_idx_340)) && p1 + 1 <= p2) && ((#memory_int[v_idx_341] == v_v_4264_1 || p2 + 1 <= v_idx_341) || v_idx_341 < p2)) && 0 <= 2 * v_v_4262_1) && 2 * v_v_4264_1 <= 0) && (#memory_int[v_idx_338] == v_v_4261_1 || p1 <= v_idx_338)))) || (2 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (#memory_int[p1] == 1 && (forall v_idx_215 : int, v_idx_218 : int, v_idx_219 : int, v_idx_216 : int, v_idx_217 : int :: (exists v_v_2708_1 : int, v_v_2709_1 : int, v_v_2710_1 : int, v_v_2711_1 : int, v_v_2712_1 : int :: (((((((((v_idx_217 < p1 + 1 || p2 <= v_idx_217) || #memory_int[v_idx_217] == v_v_2710_1) && 0 <= 2 * v_v_2709_1) && (#memory_int[v_idx_215] == v_v_2708_1 || p1 <= v_idx_215)) && ((#memory_int[v_idx_218] == v_v_2711_1 || v_idx_218 < p2) || p2 + 1 <= v_idx_218)) && 2 * v_v_2711_1 <= 0) && v_v_2711_1 <= v_v_2709_1) && (#memory_int[v_idx_219] == v_v_2712_1 || v_idx_219 < p2 + 1)) && p1 + 1 <= p2) && ((v_idx_216 < p1 || p1 + 1 <= v_idx_216) || #memory_int[v_idx_216] == v_v_2709_1))))) || ((1 <= #memory_int[p1] || 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 426.9s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 72.5s AutomataDifference, 0.0s DeadEndRemovalTime, 299.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 36 SDslu, 1 SDs, 0 SdLazy, 208 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 35.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 26.7s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 1096 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5400 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1334 FormulaSimplificationTreeSizeReductionInter, 299.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 59 ConstructedInterpolants, 7 QuantifiedInterpolants, 2414 SizeOfPredicates, 4 NumberOfNonLiveVariables, 62 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 15/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...