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-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 18:07:39,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 18:07:39,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 18:07:40,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 18:07:40,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 18:07:40,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 18:07:40,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 18:07:40,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 18:07:40,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 18:07:40,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 18:07:40,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 18:07:40,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 18:07:40,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 18:07:40,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 18:07:40,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 18:07:40,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 18:07:40,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 18:07:40,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 18:07:40,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 18:07:40,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 18:07:40,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 18:07:40,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 18:07:40,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 18:07:40,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 18:07:40,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 18:07:40,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 18:07:40,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 18:07:40,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 18:07:40,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 18:07:40,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 18:07:40,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 18:07:40,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 18:07:40,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 18:07:40,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 18:07:40,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 18:07:40,060 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 18:07:40,060 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-18 18:07:40,078 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 18:07:40,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 18:07:40,080 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 18:07:40,080 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 18:07:40,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 18:07:40,080 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 18:07:40,080 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 18:07:40,081 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 18:07:40,081 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 18:07:40,082 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 18:07:40,082 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 18:07:40,082 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 18:07:40,082 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 18:07:40,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 18:07:40,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 18:07:40,083 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 18:07:40,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 18:07:40,085 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 18:07:40,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 18:07:40,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 18:07:40,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 18:07:40,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 18:07:40,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 18:07:40,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 18:07:40,087 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 18:07:40,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 18:07:40,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 18:07:40,089 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 18:07:40,089 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 18:07:40,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 18:07:40,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:07:40,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 18:07:40,090 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 18:07:40,090 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 18:07:40,090 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 18:07:40,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 18:07:40,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 18:07:40,091 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 18:07:40,091 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 18:07:40,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 18:07:40,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 18:07:40,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 18:07:40,144 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 18:07:40,144 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 18:07:40,145 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-18 18:07:40,145 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-18 18:07:40,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 18:07:40,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 18:07:40,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:40,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 18:07:40,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 18:07:40,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:40,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 18:07:40,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 18:07:40,261 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 18:07:40,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/1) ... [2019-01-18 18:07:40,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 18:07:40,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 18:07:40,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 18:07:40,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 18:07:40,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (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-18 18:07:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 18:07:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 18:07:40,654 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 18:07:40,654 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-18 18:07:40,655 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:40 BoogieIcfgContainer [2019-01-18 18:07:40,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 18:07:40,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 18:07:40,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 18:07:40,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 18:07:40,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:40" (1/2) ... [2019-01-18 18:07:40,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4022853 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 06:07:40, skipping insertion in model container [2019-01-18 18:07:40,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:40" (2/2) ... [2019-01-18 18:07:40,663 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-18 18:07:40,673 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 18:07:40,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-18 18:07:40,700 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-18 18:07:40,732 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 18:07:40,732 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 18:07:40,733 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 18:07:40,733 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 18:07:40,733 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 18:07:40,733 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 18:07:40,733 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 18:07:40,734 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 18:07:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-18 18:07:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 18:07:40,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:40,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 18:07:40,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-18 18:07:40,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:40,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:40,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:40,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:41,012 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-18 18:07:41,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:41,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:41,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:41,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:41,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:41,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:41,045 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-18 18:07:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:41,233 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-18 18:07:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:41,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 18:07:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:41,250 INFO L225 Difference]: With dead ends: 21 [2019-01-18 18:07:41,250 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 18:07:41,255 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-18 18:07:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 18:07:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-18 18:07:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 18:07:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-18 18:07:41,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-18 18:07:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:41,299 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-18 18:07:41,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-18 18:07:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:41,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:41,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:41,300 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:41,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-18 18:07:41,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:41,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:41,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:41,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:41,418 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-18 18:07:41,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:41,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:41,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:41,421 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-18 18:07:41,471 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:41,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:51,704 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:07:51,706 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-18 18:07:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:51,712 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:07:52,088 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-18 18:07:52,088 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:07:54,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_79 Int) (v_idx_87 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int)) (exists ((v_b_121_1 Int) (v_v_1351_1 Int) (v_v_1353_1 Int) (v_b_120_1 Int) (v_v_1356_1 Int) (v_v_1355_1 Int) (v_b_119_1 Int) (v_b_118_1 Int) (v_v_1357_1 Int) (v_v_1349_1 Int)) (let ((.cse1 (+ v_b_120_1 1)) (.cse4 (+ v_b_118_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ v_b_119_1 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse7 (+ v_b_118_1 2))) (and (or (< v_idx_81 .cse0) (= (select |c_#memory_int| v_idx_81) v_v_1351_1) (<= v_b_118_1 v_idx_81)) (<= .cse1 v_b_121_1) (<= v_b_121_1 .cse1) (<= .cse2 v_b_120_1) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse4 v_b_120_1) (<= (* 2 v_v_1356_1) 0) (<= .cse0 v_b_118_1) (<= .cse4 v_b_119_1) (or (<= .cse5 v_idx_86) (= (select |c_#memory_int| v_idx_86) v_v_1356_1) (< v_idx_86 c_ULTIMATE.start_main_p4)) (<= v_v_1356_1 0) (or (= (select |c_#memory_int| v_idx_83) v_v_1353_1) (<= v_b_120_1 v_idx_83) (< v_idx_83 v_b_119_1)) (<= v_b_119_1 v_b_120_1) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p4) (<= v_b_119_1 .cse4) (or (< v_idx_82 v_b_118_1) (= 0 (select |c_#memory_int| v_idx_82)) (<= v_b_119_1 v_idx_82)) (<= .cse7 v_b_121_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_79) (= (select |c_#memory_int| v_idx_79) v_v_1349_1)) (or (<= .cse0 v_idx_80) (= 0 (select |c_#memory_int| v_idx_80)) (< v_idx_80 c_ULTIMATE.start_main_p1)) (<= .cse3 v_b_121_1) (<= v_b_121_1 c_ULTIMATE.start_main_p4) (<= .cse6 v_b_121_1) (<= .cse2 v_b_119_1) (or (< v_idx_84 v_b_120_1) (= 0 (select |c_#memory_int| v_idx_84)) (<= v_b_121_1 v_idx_84)) (or (= (select |c_#memory_int| v_idx_87) v_v_1357_1) (< v_idx_87 .cse5)) (or (< v_idx_85 v_b_121_1) (<= c_ULTIMATE.start_main_p4 v_idx_85) (= (select |c_#memory_int| v_idx_85) v_v_1355_1)) (<= .cse7 c_ULTIMATE.start_main_p4))))) is different from false [2019-01-18 18:07:56,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_89 Int) (v_idx_88 Int) (v_idx_96 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_b_122_1 Int) (v_b_121_1 Int) (v_b_123_1 Int) (v_v_1351_1 Int) (v_v_1353_1 Int) (v_b_120_1 Int) (v_v_1356_1 Int) (v_v_1355_1 Int) (v_b_119_1 Int) (v_b_118_1 Int) (v_v_1357_1 Int) (v_v_1349_1 Int)) (let ((.cse1 (+ v_b_120_1 1)) (.cse4 (+ v_b_118_1 1)) (.cse0 (+ v_b_118_1 2)) (.cse6 (+ v_b_119_1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p1 2)) (.cse7 (+ v_b_122_1 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse0 v_b_122_1) (<= .cse1 v_b_121_1) (<= v_b_121_1 .cse1) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_123_1) (<= .cse2 v_b_120_1) (<= .cse3 v_b_122_1) (<= .cse4 v_b_120_1) (<= (* 2 v_v_1356_1) 0) (<= .cse5 v_b_118_1) (<= .cse4 v_b_119_1) (<= (+ v_b_119_1 2) v_b_123_1) (<= v_v_1356_1 0) (or (= (select |c_#memory_int| v_idx_92) v_v_1353_1) (< v_idx_92 v_b_119_1) (<= v_b_120_1 v_idx_92)) (or (< v_idx_91 v_b_118_1) (<= v_b_119_1 v_idx_91) (= 0 (select |c_#memory_int| v_idx_91))) (or (< v_idx_89 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_89)) (<= .cse5 v_idx_89)) (<= v_b_119_1 v_b_120_1) (<= .cse1 v_b_122_1) (<= v_b_121_1 v_b_122_1) (<= .cse6 v_b_122_1) (<= v_b_119_1 .cse4) (<= .cse0 v_b_121_1) (or (<= v_b_121_1 v_idx_93) (< v_idx_93 v_b_120_1) (= 0 (select |c_#memory_int| v_idx_93))) (or (= (select |c_#memory_int| v_idx_96) v_v_1357_1) (< v_idx_96 v_b_123_1)) (<= .cse6 v_b_121_1) (<= (+ v_b_121_1 1) v_b_123_1) (<= .cse3 v_b_121_1) (<= .cse7 v_b_123_1) (<= .cse2 v_b_119_1) (or (= (select |c_#memory_int| v_idx_94) v_v_1355_1) (< v_idx_94 v_b_121_1) (<= v_b_122_1 v_idx_94)) (<= v_b_123_1 .cse7) (<= (+ v_b_120_1 2) v_b_123_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_88) (= (select |c_#memory_int| v_idx_88) v_v_1349_1)) (or (< v_idx_90 .cse5) (<= v_b_118_1 v_idx_90) (= (select |c_#memory_int| v_idx_90) v_v_1351_1)) (<= (+ v_b_118_1 3) v_b_123_1) (or (< v_idx_95 v_b_122_1) (= (select |c_#memory_int| v_idx_95) v_v_1356_1) (<= v_b_123_1 v_idx_95)))))) is different from false [2019-01-18 18:07:58,414 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_idx_89 Int) (v_idx_88 Int) (v_idx_96 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_b_122_1 Int) (v_b_121_1 Int) (v_b_123_1 Int) (v_v_1351_1 Int) (v_v_1353_1 Int) (v_b_120_1 Int) (v_v_1356_1 Int) (v_v_1355_1 Int) (v_b_119_1 Int) (v_b_118_1 Int) (v_v_1357_1 Int) (v_v_1349_1 Int)) (let ((.cse1 (+ v_b_120_1 1)) (.cse4 (+ v_b_118_1 1)) (.cse0 (+ v_b_118_1 2)) (.cse6 (+ v_b_119_1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p1 2)) (.cse7 (+ v_b_122_1 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse0 v_b_122_1) (<= .cse1 v_b_121_1) (<= v_b_121_1 .cse1) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_123_1) (<= .cse2 v_b_120_1) (<= .cse3 v_b_122_1) (<= .cse4 v_b_120_1) (<= (* 2 v_v_1356_1) 0) (<= .cse5 v_b_118_1) (<= .cse4 v_b_119_1) (<= (+ v_b_119_1 2) v_b_123_1) (<= v_v_1356_1 0) (or (= (select |c_#memory_int| v_idx_92) v_v_1353_1) (< v_idx_92 v_b_119_1) (<= v_b_120_1 v_idx_92)) (or (< v_idx_91 v_b_118_1) (<= v_b_119_1 v_idx_91) (= 0 (select |c_#memory_int| v_idx_91))) (or (< v_idx_89 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_89)) (<= .cse5 v_idx_89)) (<= v_b_119_1 v_b_120_1) (<= .cse1 v_b_122_1) (<= v_b_121_1 v_b_122_1) (<= .cse6 v_b_122_1) (<= v_b_119_1 .cse4) (<= .cse0 v_b_121_1) (or (<= v_b_121_1 v_idx_93) (< v_idx_93 v_b_120_1) (= 0 (select |c_#memory_int| v_idx_93))) (or (= (select |c_#memory_int| v_idx_96) v_v_1357_1) (< v_idx_96 v_b_123_1)) (<= .cse6 v_b_121_1) (<= (+ v_b_121_1 1) v_b_123_1) (<= .cse3 v_b_121_1) (<= .cse7 v_b_123_1) (<= .cse2 v_b_119_1) (or (= (select |c_#memory_int| v_idx_94) v_v_1355_1) (< v_idx_94 v_b_121_1) (<= v_b_122_1 v_idx_94)) (<= v_b_123_1 .cse7) (<= (+ v_b_120_1 2) v_b_123_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_88) (= (select |c_#memory_int| v_idx_88) v_v_1349_1)) (or (< v_idx_90 .cse5) (<= v_b_118_1 v_idx_90) (= (select |c_#memory_int| v_idx_90) v_v_1351_1)) (<= (+ v_b_118_1 3) v_b_123_1) (or (< v_idx_95 v_b_122_1) (= (select |c_#memory_int| v_idx_95) v_v_1356_1) (<= v_b_123_1 v_idx_95)))))) is different from true [2019-01-18 18:07:58,416 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:07:58,416 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:07:58,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:07:58,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:07:58,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:58,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:07:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:07:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2019-01-18 18:07:58,420 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2019-01-18 18:08:00,724 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_79 Int) (v_idx_87 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int)) (exists ((v_b_121_1 Int) (v_v_1351_1 Int) (v_v_1353_1 Int) (v_b_120_1 Int) (v_v_1356_1 Int) (v_v_1355_1 Int) (v_b_119_1 Int) (v_b_118_1 Int) (v_v_1357_1 Int) (v_v_1349_1 Int)) (let ((.cse1 (+ v_b_120_1 1)) (.cse4 (+ v_b_118_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ v_b_119_1 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 3)) (.cse2 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse7 (+ v_b_118_1 2))) (and (or (< v_idx_81 .cse0) (= (select |c_#memory_int| v_idx_81) v_v_1351_1) (<= v_b_118_1 v_idx_81)) (<= .cse1 v_b_121_1) (<= v_b_121_1 .cse1) (<= .cse2 v_b_120_1) (<= .cse3 c_ULTIMATE.start_main_p4) (<= .cse4 v_b_120_1) (<= (* 2 v_v_1356_1) 0) (<= .cse0 v_b_118_1) (<= .cse4 v_b_119_1) (or (<= .cse5 v_idx_86) (= (select |c_#memory_int| v_idx_86) v_v_1356_1) (< v_idx_86 c_ULTIMATE.start_main_p4)) (<= v_v_1356_1 0) (or (= (select |c_#memory_int| v_idx_83) v_v_1353_1) (<= v_b_120_1 v_idx_83) (< v_idx_83 v_b_119_1)) (<= v_b_119_1 v_b_120_1) (<= .cse1 c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p4) (<= v_b_119_1 .cse4) (or (< v_idx_82 v_b_118_1) (= 0 (select |c_#memory_int| v_idx_82)) (<= v_b_119_1 v_idx_82)) (<= .cse7 v_b_121_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_79) (= (select |c_#memory_int| v_idx_79) v_v_1349_1)) (or (<= .cse0 v_idx_80) (= 0 (select |c_#memory_int| v_idx_80)) (< v_idx_80 c_ULTIMATE.start_main_p1)) (<= .cse3 v_b_121_1) (<= v_b_121_1 c_ULTIMATE.start_main_p4) (<= .cse6 v_b_121_1) (<= .cse2 v_b_119_1) (or (< v_idx_84 v_b_120_1) (= 0 (select |c_#memory_int| v_idx_84)) (<= v_b_121_1 v_idx_84)) (or (= (select |c_#memory_int| v_idx_87) v_v_1357_1) (< v_idx_87 .cse5)) (or (< v_idx_85 v_b_121_1) (<= c_ULTIMATE.start_main_p4 v_idx_85) (= (select |c_#memory_int| v_idx_85) v_v_1355_1)) (<= .cse7 c_ULTIMATE.start_main_p4))))) (forall ((v_idx_89 Int) (v_idx_88 Int) (v_idx_96 Int) (v_idx_94 Int) (v_idx_95 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int)) (exists ((v_b_122_1 Int) (v_b_121_1 Int) (v_b_123_1 Int) (v_v_1351_1 Int) (v_v_1353_1 Int) (v_b_120_1 Int) (v_v_1356_1 Int) (v_v_1355_1 Int) (v_b_119_1 Int) (v_b_118_1 Int) (v_v_1357_1 Int) (v_v_1349_1 Int)) (let ((.cse9 (+ v_b_120_1 1)) (.cse12 (+ v_b_118_1 1)) (.cse8 (+ v_b_118_1 2)) (.cse14 (+ v_b_119_1 1)) (.cse11 (+ c_ULTIMATE.start_main_p1 3)) (.cse10 (+ c_ULTIMATE.start_main_p1 2)) (.cse15 (+ v_b_122_1 1)) (.cse13 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse8 v_b_122_1) (<= .cse9 v_b_121_1) (<= v_b_121_1 .cse9) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_123_1) (<= .cse10 v_b_120_1) (<= .cse11 v_b_122_1) (<= .cse12 v_b_120_1) (<= (* 2 v_v_1356_1) 0) (<= .cse13 v_b_118_1) (<= .cse12 v_b_119_1) (<= (+ v_b_119_1 2) v_b_123_1) (<= v_v_1356_1 0) (or (= (select |c_#memory_int| v_idx_92) v_v_1353_1) (< v_idx_92 v_b_119_1) (<= v_b_120_1 v_idx_92)) (or (< v_idx_91 v_b_118_1) (<= v_b_119_1 v_idx_91) (= 0 (select |c_#memory_int| v_idx_91))) (or (< v_idx_89 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_89)) (<= .cse13 v_idx_89)) (<= v_b_119_1 v_b_120_1) (<= .cse9 v_b_122_1) (<= v_b_121_1 v_b_122_1) (<= .cse14 v_b_122_1) (<= v_b_119_1 .cse12) (<= .cse8 v_b_121_1) (or (<= v_b_121_1 v_idx_93) (< v_idx_93 v_b_120_1) (= 0 (select |c_#memory_int| v_idx_93))) (or (= (select |c_#memory_int| v_idx_96) v_v_1357_1) (< v_idx_96 v_b_123_1)) (<= .cse14 v_b_121_1) (<= (+ v_b_121_1 1) v_b_123_1) (<= .cse11 v_b_121_1) (<= .cse15 v_b_123_1) (<= .cse10 v_b_119_1) (or (= (select |c_#memory_int| v_idx_94) v_v_1355_1) (< v_idx_94 v_b_121_1) (<= v_b_122_1 v_idx_94)) (<= v_b_123_1 .cse15) (<= (+ v_b_120_1 2) v_b_123_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_88) (= (select |c_#memory_int| v_idx_88) v_v_1349_1)) (or (< v_idx_90 .cse13) (<= v_b_118_1 v_idx_90) (= (select |c_#memory_int| v_idx_90) v_v_1351_1)) (<= (+ v_b_118_1 3) v_b_123_1) (or (< v_idx_95 v_b_122_1) (= (select |c_#memory_int| v_idx_95) v_v_1356_1) (<= v_b_123_1 v_idx_95))))))) is different from false [2019-01-18 18:08:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:28,012 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-18 18:08:28,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:28,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:28,014 INFO L225 Difference]: With dead ends: 12 [2019-01-18 18:08:28,014 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 18:08:28,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7, Invalid=3, Unknown=4, NotChecked=6, Total=20 [2019-01-18 18:08:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 18:08:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 18:08:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 18:08:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2019-01-18 18:08:28,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 3 [2019-01-18 18:08:28,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:28,021 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 22 transitions. [2019-01-18 18:08:28,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2019-01-18 18:08:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:28,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:28,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:28,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-18 18:08:28,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:28,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:28,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:28,102 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-18 18:08:28,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:28,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:08:28,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:28,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:08:28,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:08:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:08:28,104 INFO L87 Difference]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2019-01-18 18:08:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:28,322 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-01-18 18:08:28,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:28,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 18:08:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:28,324 INFO L225 Difference]: With dead ends: 17 [2019-01-18 18:08:28,324 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 18:08:28,325 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-18 18:08:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 18:08:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-01-18 18:08:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:08:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-18 18:08:28,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-18 18:08:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:28,332 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-18 18:08:28,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:08:28,332 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-18 18:08:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:28,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:28,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:28,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-18 18:08:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:28,387 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-18 18:08:28,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:28,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:28,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:28,388 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-18 18:08:28,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:28,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:33,922 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:08:33,923 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-18 18:08:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:33,923 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:08:34,289 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2019-01-18 18:08:34,290 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:36,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_179 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_177 Int) (v_idx_178 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_1350_2 Int) (v_b_134_2 Int) (v_v_1352_2 Int) (v_v_1354_2 Int) (v_b_137_2 Int) (v_b_138_2 Int) (v_v_1356_2 Int) (v_b_135_2 Int) (v_b_136_2 Int) (v_v_1348_2 Int) (v_v_1349_2 Int) (v_b_139_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ v_b_134_2 2)) (.cse4 (+ v_b_135_2 1)) (.cse3 (+ v_b_136_2 1)) (.cse2 (+ v_b_134_2 1)) (.cse7 (+ v_b_138_2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse6 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (<= .cse0 v_b_135_2) (<= (+ v_b_136_2 2) v_b_139_2) (<= 0 (* 2 v_v_1349_2)) (<= .cse1 v_b_137_2) (<= .cse2 v_b_135_2) (or (<= v_b_139_2 v_idx_182) (= 0 (select |c_#memory_int| v_idx_182)) (< v_idx_182 v_b_138_2)) (<= 0 v_v_1349_2) (or (= (select |c_#memory_int| v_idx_178) 0) (< v_idx_178 v_b_134_2) (<= v_b_135_2 v_idx_178)) (<= v_b_135_2 v_b_136_2) (<= v_b_137_2 .cse3) (<= .cse4 v_b_138_2) (or (< v_idx_181 v_b_137_2) (<= v_b_138_2 v_idx_181) (= (select |c_#memory_int| v_idx_181) v_v_1354_2)) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse0 v_b_136_2) (<= v_b_135_2 .cse2) (<= .cse5 v_b_137_2) (or (= (select |c_#memory_int| v_idx_176) v_v_1349_2) (< v_idx_176 c_ULTIMATE.start_main_p1) (<= .cse6 v_idx_176)) (<= .cse5 v_b_138_2) (<= .cse4 v_b_137_2) (or (= (select |c_#memory_int| v_idx_175) v_v_1348_2) (<= c_ULTIMATE.start_main_p1 v_idx_175)) (<= v_b_137_2 v_b_138_2) (<= .cse3 v_b_137_2) (<= .cse3 v_b_138_2) (<= v_b_139_2 .cse7) (<= .cse2 v_b_136_2) (or (< v_idx_177 .cse6) (= (select |c_#memory_int| v_idx_177) v_v_1350_2) (<= v_b_134_2 v_idx_177)) (<= .cse7 v_b_139_2) (or (< v_idx_180 v_b_136_2) (<= v_b_137_2 v_idx_180) (= (select |c_#memory_int| v_idx_180) 0)) (or (<= v_b_136_2 v_idx_179) (= (select |c_#memory_int| v_idx_179) v_v_1352_2) (< v_idx_179 v_b_135_2)) (<= .cse1 v_b_138_2) (or (= (select |c_#memory_int| v_idx_183) v_v_1356_2) (< v_idx_183 v_b_139_2)) (<= .cse6 v_b_134_2))))) is different from false [2019-01-18 18:08:39,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_190 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_188 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_187 Int)) (exists ((v_v_1350_2 Int) (v_b_134_2 Int) (v_v_1352_2 Int) (v_v_1354_2 Int) (v_b_137_2 Int) (v_v_1356_2 Int) (v_b_138_2 Int) (v_b_135_2 Int) (v_b_136_2 Int) (v_v_1348_2 Int) (v_v_1349_2 Int) (v_b_139_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_2 2)) (.cse5 (+ v_b_135_2 1)) (.cse4 (+ v_b_136_2 1)) (.cse2 (+ v_b_134_2 1)) (.cse7 (+ v_b_138_2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (or (= (select |c_#memory_int| v_idx_192) v_v_1356_2) (< v_idx_192 v_b_139_2)) (<= .cse0 v_b_135_2) (<= (+ v_b_136_2 2) v_b_139_2) (<= 0 (* 2 v_v_1349_2)) (<= .cse1 v_b_137_2) (<= .cse2 v_b_135_2) (<= 0 v_v_1349_2) (or (< v_idx_185 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_185) (= (select |c_#memory_int| v_idx_185) v_v_1349_2)) (<= v_b_135_2 v_b_136_2) (<= v_b_137_2 .cse4) (<= .cse5 v_b_138_2) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse0 v_b_136_2) (<= v_b_135_2 .cse2) (<= .cse6 v_b_137_2) (or (= (select |c_#memory_int| v_idx_186) v_v_1350_2) (< v_idx_186 .cse3) (<= v_b_134_2 v_idx_186)) (<= .cse6 v_b_138_2) (<= .cse5 v_b_137_2) (or (= (select |c_#memory_int| v_idx_188) v_v_1352_2) (<= v_b_136_2 v_idx_188) (< v_idx_188 v_b_135_2)) (or (< v_idx_187 v_b_134_2) (= 0 (select |c_#memory_int| v_idx_187)) (<= v_b_135_2 v_idx_187)) (<= v_b_137_2 v_b_138_2) (<= .cse4 v_b_137_2) (<= .cse4 v_b_138_2) (<= v_b_139_2 .cse7) (or (<= v_b_139_2 v_idx_191) (< v_idx_191 v_b_138_2) (= (select |c_#memory_int| v_idx_191) 0)) (or (<= v_b_138_2 v_idx_190) (= (select |c_#memory_int| v_idx_190) v_v_1354_2) (< v_idx_190 v_b_137_2)) (or (= (select |c_#memory_int| v_idx_189) 0) (< v_idx_189 v_b_136_2) (<= v_b_137_2 v_idx_189)) (<= .cse2 v_b_136_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_184) (= (select |c_#memory_int| v_idx_184) v_v_1348_2)) (<= .cse7 v_b_139_2) (<= .cse1 v_b_138_2) (<= .cse3 v_b_134_2))))) is different from false [2019-01-18 18:08:39,533 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:08:39,533 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:39,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:39,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:08:39,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:39,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:39,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:08:39,535 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2019-01-18 18:08:42,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_190 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_188 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_187 Int)) (exists ((v_v_1350_2 Int) (v_b_134_2 Int) (v_v_1352_2 Int) (v_v_1354_2 Int) (v_b_137_2 Int) (v_v_1356_2 Int) (v_b_138_2 Int) (v_b_135_2 Int) (v_b_136_2 Int) (v_v_1348_2 Int) (v_v_1349_2 Int) (v_b_139_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_2 2)) (.cse5 (+ v_b_135_2 1)) (.cse4 (+ v_b_136_2 1)) (.cse2 (+ v_b_134_2 1)) (.cse7 (+ v_b_138_2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (or (= (select |c_#memory_int| v_idx_192) v_v_1356_2) (< v_idx_192 v_b_139_2)) (<= .cse0 v_b_135_2) (<= (+ v_b_136_2 2) v_b_139_2) (<= 0 (* 2 v_v_1349_2)) (<= .cse1 v_b_137_2) (<= .cse2 v_b_135_2) (<= 0 v_v_1349_2) (or (< v_idx_185 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_185) (= (select |c_#memory_int| v_idx_185) v_v_1349_2)) (<= v_b_135_2 v_b_136_2) (<= v_b_137_2 .cse4) (<= .cse5 v_b_138_2) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse0 v_b_136_2) (<= v_b_135_2 .cse2) (<= .cse6 v_b_137_2) (or (= (select |c_#memory_int| v_idx_186) v_v_1350_2) (< v_idx_186 .cse3) (<= v_b_134_2 v_idx_186)) (<= .cse6 v_b_138_2) (<= .cse5 v_b_137_2) (or (= (select |c_#memory_int| v_idx_188) v_v_1352_2) (<= v_b_136_2 v_idx_188) (< v_idx_188 v_b_135_2)) (or (< v_idx_187 v_b_134_2) (= 0 (select |c_#memory_int| v_idx_187)) (<= v_b_135_2 v_idx_187)) (<= v_b_137_2 v_b_138_2) (<= .cse4 v_b_137_2) (<= .cse4 v_b_138_2) (<= v_b_139_2 .cse7) (or (<= v_b_139_2 v_idx_191) (< v_idx_191 v_b_138_2) (= (select |c_#memory_int| v_idx_191) 0)) (or (<= v_b_138_2 v_idx_190) (= (select |c_#memory_int| v_idx_190) v_v_1354_2) (< v_idx_190 v_b_137_2)) (or (= (select |c_#memory_int| v_idx_189) 0) (< v_idx_189 v_b_136_2) (<= v_b_137_2 v_idx_189)) (<= .cse2 v_b_136_2) (or (<= c_ULTIMATE.start_main_p1 v_idx_184) (= (select |c_#memory_int| v_idx_184) v_v_1348_2)) (<= .cse7 v_b_139_2) (<= .cse1 v_b_138_2) (<= .cse3 v_b_134_2))))) (forall ((v_idx_179 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_177 Int) (v_idx_178 Int) (v_idx_175 Int) (v_idx_176 Int)) (exists ((v_v_1350_2 Int) (v_b_134_2 Int) (v_v_1352_2 Int) (v_v_1354_2 Int) (v_b_137_2 Int) (v_b_138_2 Int) (v_v_1356_2 Int) (v_b_135_2 Int) (v_b_136_2 Int) (v_v_1348_2 Int) (v_v_1349_2 Int) (v_b_139_2 Int)) (let ((.cse8 (+ c_ULTIMATE.start_main_p1 2)) (.cse13 (+ v_b_134_2 2)) (.cse12 (+ v_b_135_2 1)) (.cse11 (+ v_b_136_2 1)) (.cse10 (+ v_b_134_2 1)) (.cse15 (+ v_b_138_2 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 3)) (.cse14 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_2) (<= .cse8 v_b_135_2) (<= (+ v_b_136_2 2) v_b_139_2) (<= 0 (* 2 v_v_1349_2)) (<= .cse9 v_b_137_2) (<= .cse10 v_b_135_2) (or (<= v_b_139_2 v_idx_182) (= 0 (select |c_#memory_int| v_idx_182)) (< v_idx_182 v_b_138_2)) (<= 0 v_v_1349_2) (or (= (select |c_#memory_int| v_idx_178) 0) (< v_idx_178 v_b_134_2) (<= v_b_135_2 v_idx_178)) (<= v_b_135_2 v_b_136_2) (<= v_b_137_2 .cse11) (<= .cse12 v_b_138_2) (or (< v_idx_181 v_b_137_2) (<= v_b_138_2 v_idx_181) (= (select |c_#memory_int| v_idx_181) v_v_1354_2)) (<= (+ v_b_137_2 1) v_b_139_2) (<= (+ v_b_135_2 2) v_b_139_2) (<= (+ v_b_134_2 3) v_b_139_2) (<= .cse8 v_b_136_2) (<= v_b_135_2 .cse10) (<= .cse13 v_b_137_2) (or (= (select |c_#memory_int| v_idx_176) v_v_1349_2) (< v_idx_176 c_ULTIMATE.start_main_p1) (<= .cse14 v_idx_176)) (<= .cse13 v_b_138_2) (<= .cse12 v_b_137_2) (or (= (select |c_#memory_int| v_idx_175) v_v_1348_2) (<= c_ULTIMATE.start_main_p1 v_idx_175)) (<= v_b_137_2 v_b_138_2) (<= .cse11 v_b_137_2) (<= .cse11 v_b_138_2) (<= v_b_139_2 .cse15) (<= .cse10 v_b_136_2) (or (< v_idx_177 .cse14) (= (select |c_#memory_int| v_idx_177) v_v_1350_2) (<= v_b_134_2 v_idx_177)) (<= .cse15 v_b_139_2) (or (< v_idx_180 v_b_136_2) (<= v_b_137_2 v_idx_180) (= (select |c_#memory_int| v_idx_180) 0)) (or (<= v_b_136_2 v_idx_179) (= (select |c_#memory_int| v_idx_179) v_v_1352_2) (< v_idx_179 v_b_135_2)) (<= .cse9 v_b_138_2) (or (= (select |c_#memory_int| v_idx_183) v_v_1356_2) (< v_idx_183 v_b_139_2)) (<= .cse14 v_b_134_2)))))) is different from false [2019-01-18 18:08:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:59,985 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-18 18:08:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:59,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:59,986 INFO L225 Difference]: With dead ends: 14 [2019-01-18 18:08:59,986 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 18:08:59,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:08:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 18:08:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-18 18:08:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:08:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-18 18:08:59,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-18 18:08:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:59,993 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-18 18:08:59,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-18 18:08:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:59,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:59,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:59,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:59,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-18 18:08:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:59,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:59,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:00,060 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-18 18:09:00,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:00,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:00,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:09:00,061 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-18 18:09:00,062 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:00,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:05,748 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:09:05,748 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-18 18:09:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:05,749 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:09:06,013 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-18 18:09:06,013 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:09:08,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_278 Int) (v_idx_279 Int) (v_idx_272 Int) (v_idx_273 Int) (v_idx_271 Int) (v_idx_276 Int) (v_idx_277 Int) (v_idx_274 Int) (v_idx_275 Int)) (exists ((v_v_1453_3 Int) (v_v_1452_3 Int) (v_v_1450_3 Int) (v_b_136_3 Int) (v_b_137_3 Int) (v_v_1456_3 Int) (v_v_1454_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1458_3 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 2)) (.cse4 (+ v_b_136_3 1)) (.cse3 (+ v_b_138_3 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_274 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_274) v_v_1453_3) (<= .cse0 v_idx_274)) (<= .cse1 v_b_138_3) (<= .cse1 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= .cse2 v_b_138_3) (<= .cse3 v_b_139_3) (<= v_b_137_3 v_b_138_3) (<= .cse0 v_b_136_3) (or (= (select |c_#memory_int| v_idx_275) v_v_1454_3) (<= v_b_136_3 v_idx_275) (< v_idx_275 .cse0)) (or (<= v_b_137_3 v_idx_276) (= 0 (select |c_#memory_int| v_idx_276)) (< v_idx_276 v_b_136_3)) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse4 v_b_138_3) (<= (+ c_ULTIMATE.start_main_p2 3) v_b_139_3) (<= .cse4 v_b_137_3) (or (< v_idx_273 .cse5) (= (select |c_#memory_int| v_idx_273) v_v_1452_3) (<= c_ULTIMATE.start_main_p2 v_idx_273)) (or (<= v_b_139_3 v_idx_278) (< v_idx_278 v_b_138_3) (= 0 (select |c_#memory_int| v_idx_278))) (<= (* 2 v_v_1453_3) 0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_136_3) (or (= (select |c_#memory_int| v_idx_279) v_v_1458_3) (< v_idx_279 v_b_139_3)) (<= .cse2 v_b_137_3) (or (< v_idx_277 v_b_137_3) (<= v_b_138_3 v_idx_277) (= (select |c_#memory_int| v_idx_277) v_v_1456_3)) (<= v_b_137_3 .cse4) (<= v_b_139_3 .cse3) (<= v_v_1453_3 0) (<= (+ v_b_136_3 2) v_b_139_3) (<= .cse5 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_271) v_v_1450_3) (<= c_ULTIMATE.start_main_p1 v_idx_271)) (or (= (select |c_#memory_int| v_idx_272) 0) (<= .cse5 v_idx_272) (< v_idx_272 c_ULTIMATE.start_main_p1)))))) is different from false [2019-01-18 18:09:10,988 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_280 Int) (v_idx_283 Int) (v_idx_284 Int) (v_idx_281 Int) (v_idx_282 Int) (v_idx_287 Int) (v_idx_288 Int) (v_idx_285 Int) (v_idx_286 Int)) (exists ((v_v_1453_3 Int) (v_v_1452_3 Int) (v_v_1450_3 Int) (v_b_136_3 Int) (v_v_1456_3 Int) (v_b_137_3 Int) (v_b_134_3 Int) (v_b_135_3 Int) (v_v_1454_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1458_3 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_134_3 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ v_b_135_3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_3 2)) (.cse7 (+ v_b_136_3 1)) (.cse5 (+ v_b_138_3 1))) (and (<= .cse0 v_b_138_3) (or (= (select |c_#memory_int| v_idx_282) v_v_1452_3) (< v_idx_282 .cse1) (<= v_b_134_3 v_idx_282)) (or (= (select |c_#memory_int| v_idx_286) v_v_1456_3) (< v_idx_286 v_b_137_3) (<= v_b_138_3 v_idx_286)) (or (= 0 (select |c_#memory_int| v_idx_285)) (< v_idx_285 v_b_136_3) (<= v_b_137_3 v_idx_285)) (<= .cse2 v_b_138_3) (<= .cse1 v_b_134_3) (<= .cse2 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_b_135_3 .cse3) (<= .cse4 v_b_135_3) (<= (+ v_b_135_3 2) v_b_139_3) (<= .cse5 v_b_139_3) (<= .cse3 v_b_135_3) (<= .cse6 v_b_137_3) (<= (+ v_b_134_3 3) v_b_139_3) (<= v_b_137_3 v_b_138_3) (or (<= c_ULTIMATE.start_main_p1 v_idx_280) (= (select |c_#memory_int| v_idx_280) v_v_1450_3)) (<= .cse3 v_b_136_3) (or (<= .cse1 v_idx_281) (< v_idx_281 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_281))) (<= v_b_135_3 v_b_136_3) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse7 v_b_138_3) (<= .cse7 v_b_137_3) (<= .cse0 v_b_137_3) (<= (* 2 v_v_1453_3) 0) (<= .cse4 v_b_136_3) (<= .cse6 v_b_138_3) (or (= (select |c_#memory_int| v_idx_283) v_v_1453_3) (<= v_b_135_3 v_idx_283) (< v_idx_283 v_b_134_3)) (<= v_b_137_3 .cse7) (<= v_b_139_3 .cse5) (or (<= v_b_139_3 v_idx_287) (= 0 (select |c_#memory_int| v_idx_287)) (< v_idx_287 v_b_138_3)) (or (< v_idx_288 v_b_139_3) (= (select |c_#memory_int| v_idx_288) v_v_1458_3)) (<= v_v_1453_3 0) (or (< v_idx_284 v_b_135_3) (<= v_b_136_3 v_idx_284) (= (select |c_#memory_int| v_idx_284) v_v_1454_3)) (<= (+ v_b_136_3 2) v_b_139_3))))) is different from false [2019-01-18 18:09:13,006 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_idx_280 Int) (v_idx_283 Int) (v_idx_284 Int) (v_idx_281 Int) (v_idx_282 Int) (v_idx_287 Int) (v_idx_288 Int) (v_idx_285 Int) (v_idx_286 Int)) (exists ((v_v_1453_3 Int) (v_v_1452_3 Int) (v_v_1450_3 Int) (v_b_136_3 Int) (v_v_1456_3 Int) (v_b_137_3 Int) (v_b_134_3 Int) (v_b_135_3 Int) (v_v_1454_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1458_3 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_134_3 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ v_b_135_3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_3 2)) (.cse7 (+ v_b_136_3 1)) (.cse5 (+ v_b_138_3 1))) (and (<= .cse0 v_b_138_3) (or (= (select |c_#memory_int| v_idx_282) v_v_1452_3) (< v_idx_282 .cse1) (<= v_b_134_3 v_idx_282)) (or (= (select |c_#memory_int| v_idx_286) v_v_1456_3) (< v_idx_286 v_b_137_3) (<= v_b_138_3 v_idx_286)) (or (= 0 (select |c_#memory_int| v_idx_285)) (< v_idx_285 v_b_136_3) (<= v_b_137_3 v_idx_285)) (<= .cse2 v_b_138_3) (<= .cse1 v_b_134_3) (<= .cse2 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_b_135_3 .cse3) (<= .cse4 v_b_135_3) (<= (+ v_b_135_3 2) v_b_139_3) (<= .cse5 v_b_139_3) (<= .cse3 v_b_135_3) (<= .cse6 v_b_137_3) (<= (+ v_b_134_3 3) v_b_139_3) (<= v_b_137_3 v_b_138_3) (or (<= c_ULTIMATE.start_main_p1 v_idx_280) (= (select |c_#memory_int| v_idx_280) v_v_1450_3)) (<= .cse3 v_b_136_3) (or (<= .cse1 v_idx_281) (< v_idx_281 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_281))) (<= v_b_135_3 v_b_136_3) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse7 v_b_138_3) (<= .cse7 v_b_137_3) (<= .cse0 v_b_137_3) (<= (* 2 v_v_1453_3) 0) (<= .cse4 v_b_136_3) (<= .cse6 v_b_138_3) (or (= (select |c_#memory_int| v_idx_283) v_v_1453_3) (<= v_b_135_3 v_idx_283) (< v_idx_283 v_b_134_3)) (<= v_b_137_3 .cse7) (<= v_b_139_3 .cse5) (or (<= v_b_139_3 v_idx_287) (= 0 (select |c_#memory_int| v_idx_287)) (< v_idx_287 v_b_138_3)) (or (< v_idx_288 v_b_139_3) (= (select |c_#memory_int| v_idx_288) v_v_1458_3)) (<= v_v_1453_3 0) (or (< v_idx_284 v_b_135_3) (<= v_b_136_3 v_idx_284) (= (select |c_#memory_int| v_idx_284) v_v_1454_3)) (<= (+ v_b_136_3 2) v_b_139_3))))) is different from true [2019-01-18 18:09:13,007 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:09:13,008 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:09:13,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:09:13,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:09:13,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:13,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:09:13,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:09:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2019-01-18 18:09:13,009 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2019-01-18 18:09:15,623 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_280 Int) (v_idx_283 Int) (v_idx_284 Int) (v_idx_281 Int) (v_idx_282 Int) (v_idx_287 Int) (v_idx_288 Int) (v_idx_285 Int) (v_idx_286 Int)) (exists ((v_v_1453_3 Int) (v_v_1452_3 Int) (v_v_1450_3 Int) (v_b_136_3 Int) (v_v_1456_3 Int) (v_b_137_3 Int) (v_b_134_3 Int) (v_b_135_3 Int) (v_v_1454_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1458_3 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p1 3)) (.cse3 (+ v_b_134_3 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ v_b_135_3 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ v_b_134_3 2)) (.cse7 (+ v_b_136_3 1)) (.cse5 (+ v_b_138_3 1))) (and (<= .cse0 v_b_138_3) (or (= (select |c_#memory_int| v_idx_282) v_v_1452_3) (< v_idx_282 .cse1) (<= v_b_134_3 v_idx_282)) (or (= (select |c_#memory_int| v_idx_286) v_v_1456_3) (< v_idx_286 v_b_137_3) (<= v_b_138_3 v_idx_286)) (or (= 0 (select |c_#memory_int| v_idx_285)) (< v_idx_285 v_b_136_3) (<= v_b_137_3 v_idx_285)) (<= .cse2 v_b_138_3) (<= .cse1 v_b_134_3) (<= .cse2 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= v_b_135_3 .cse3) (<= .cse4 v_b_135_3) (<= (+ v_b_135_3 2) v_b_139_3) (<= .cse5 v_b_139_3) (<= .cse3 v_b_135_3) (<= .cse6 v_b_137_3) (<= (+ v_b_134_3 3) v_b_139_3) (<= v_b_137_3 v_b_138_3) (or (<= c_ULTIMATE.start_main_p1 v_idx_280) (= (select |c_#memory_int| v_idx_280) v_v_1450_3)) (<= .cse3 v_b_136_3) (or (<= .cse1 v_idx_281) (< v_idx_281 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_281))) (<= v_b_135_3 v_b_136_3) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse7 v_b_138_3) (<= .cse7 v_b_137_3) (<= .cse0 v_b_137_3) (<= (* 2 v_v_1453_3) 0) (<= .cse4 v_b_136_3) (<= .cse6 v_b_138_3) (or (= (select |c_#memory_int| v_idx_283) v_v_1453_3) (<= v_b_135_3 v_idx_283) (< v_idx_283 v_b_134_3)) (<= v_b_137_3 .cse7) (<= v_b_139_3 .cse5) (or (<= v_b_139_3 v_idx_287) (= 0 (select |c_#memory_int| v_idx_287)) (< v_idx_287 v_b_138_3)) (or (< v_idx_288 v_b_139_3) (= (select |c_#memory_int| v_idx_288) v_v_1458_3)) (<= v_v_1453_3 0) (or (< v_idx_284 v_b_135_3) (<= v_b_136_3 v_idx_284) (= (select |c_#memory_int| v_idx_284) v_v_1454_3)) (<= (+ v_b_136_3 2) v_b_139_3))))) (forall ((v_idx_278 Int) (v_idx_279 Int) (v_idx_272 Int) (v_idx_273 Int) (v_idx_271 Int) (v_idx_276 Int) (v_idx_277 Int) (v_idx_274 Int) (v_idx_275 Int)) (exists ((v_v_1453_3 Int) (v_v_1452_3 Int) (v_v_1450_3 Int) (v_b_136_3 Int) (v_b_137_3 Int) (v_v_1456_3 Int) (v_v_1454_3 Int) (v_b_138_3 Int) (v_b_139_3 Int) (v_v_1458_3 Int)) (let ((.cse9 (+ c_ULTIMATE.start_main_p1 3)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 2)) (.cse12 (+ v_b_136_3 1)) (.cse11 (+ v_b_138_3 1)) (.cse13 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_274 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_274) v_v_1453_3) (<= .cse8 v_idx_274)) (<= .cse9 v_b_138_3) (<= .cse9 v_b_137_3) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_3) (<= .cse10 v_b_138_3) (<= .cse11 v_b_139_3) (<= v_b_137_3 v_b_138_3) (<= .cse8 v_b_136_3) (or (= (select |c_#memory_int| v_idx_275) v_v_1454_3) (<= v_b_136_3 v_idx_275) (< v_idx_275 .cse8)) (or (<= v_b_137_3 v_idx_276) (= 0 (select |c_#memory_int| v_idx_276)) (< v_idx_276 v_b_136_3)) (<= (+ v_b_137_3 1) v_b_139_3) (<= .cse12 v_b_138_3) (<= (+ c_ULTIMATE.start_main_p2 3) v_b_139_3) (<= .cse12 v_b_137_3) (or (< v_idx_273 .cse13) (= (select |c_#memory_int| v_idx_273) v_v_1452_3) (<= c_ULTIMATE.start_main_p2 v_idx_273)) (or (<= v_b_139_3 v_idx_278) (< v_idx_278 v_b_138_3) (= 0 (select |c_#memory_int| v_idx_278))) (<= (* 2 v_v_1453_3) 0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_136_3) (or (= (select |c_#memory_int| v_idx_279) v_v_1458_3) (< v_idx_279 v_b_139_3)) (<= .cse10 v_b_137_3) (or (< v_idx_277 v_b_137_3) (<= v_b_138_3 v_idx_277) (= (select |c_#memory_int| v_idx_277) v_v_1456_3)) (<= v_b_137_3 .cse12) (<= v_b_139_3 .cse11) (<= v_v_1453_3 0) (<= (+ v_b_136_3 2) v_b_139_3) (<= .cse13 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_271) v_v_1450_3) (<= c_ULTIMATE.start_main_p1 v_idx_271)) (or (= (select |c_#memory_int| v_idx_272) 0) (<= .cse13 v_idx_272) (< v_idx_272 c_ULTIMATE.start_main_p1))))))) is different from false [2019-01-18 18:09:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:28,843 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-18 18:09:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:09:28,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:09:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:28,845 INFO L225 Difference]: With dead ends: 14 [2019-01-18 18:09:28,846 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 18:09:28,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=7, Invalid=3, Unknown=4, NotChecked=6, Total=20 [2019-01-18 18:09:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 18:09:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-18 18:09:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:09:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-18 18:09:28,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-18 18:09:28,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:28,854 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-18 18:09:28,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:09:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-18 18:09:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:09:28,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:28,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:09:28,855 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:28,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 30244, now seen corresponding path program 1 times [2019-01-18 18:09:28,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:28,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:28,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:28,925 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-18 18:09:28,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:28,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:28,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:09:28,926 INFO L207 CegarAbsIntRunner]: [0], [14], [19] [2019-01-18 18:09:28,928 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:28,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:33,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:09:33,864 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-18 18:09:33,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:33,864 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:09:34,129 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-18 18:09:34,129 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:09:36,618 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_368 Int) (v_idx_369 Int) (v_idx_367 Int) (v_idx_371 Int) (v_idx_372 Int) (v_idx_370 Int) (v_idx_375 Int) (v_idx_373 Int) (v_idx_374 Int)) (exists ((v_v_1319_4 Int) (v_v_1318_4 Int) (v_v_1320_4 Int) (v_b_135_4 Int) (v_v_1322_4 Int) (v_b_134_4 Int) (v_b_139_4 Int) (v_v_1316_4 Int) (v_v_1314_4 Int) (v_b_138_4 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_138_4 1)) (.cse3 (+ v_b_134_4 1)) (.cse4 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 2))) (and (<= 0 v_v_1319_4) (or (<= c_ULTIMATE.start_main_p1 v_idx_367) (= (select |c_#memory_int| v_idx_367) v_v_1314_4)) (or (= (select |c_#memory_int| v_idx_369) v_v_1316_4) (< v_idx_369 .cse0) (<= v_b_134_4 v_idx_369)) (<= 0 (* 2 v_v_1319_4)) (<= (+ c_ULTIMATE.start_main_p3 2) v_b_139_4) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_138_4) (or (<= c_ULTIMATE.start_main_p3 v_idx_371) (< v_idx_371 v_b_135_4) (= (select |c_#memory_int| v_idx_371) v_v_1318_4)) (<= v_b_135_4 c_ULTIMATE.start_main_p3) (<= .cse1 v_b_139_4) (or (<= v_b_139_4 v_idx_374) (= 0 (select |c_#memory_int| v_idx_374)) (< v_idx_374 v_b_138_4)) (<= (+ v_b_134_4 3) v_b_139_4) (<= .cse0 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (<= .cse2 c_ULTIMATE.start_main_p3) (<= .cse3 v_b_135_4) (<= v_b_135_4 .cse3) (or (<= v_b_135_4 v_idx_370) (< v_idx_370 v_b_134_4) (= 0 (select |c_#memory_int| v_idx_370))) (or (< v_idx_372 c_ULTIMATE.start_main_p3) (<= .cse4 v_idx_372) (= (select |c_#memory_int| v_idx_372) v_v_1319_4)) (or (= 0 (select |c_#memory_int| v_idx_368)) (<= .cse0 v_idx_368) (< v_idx_368 c_ULTIMATE.start_main_p1)) (<= v_b_139_4 .cse1) (<= (+ v_b_135_4 2) v_b_139_4) (or (= (select |c_#memory_int| v_idx_375) v_v_1322_4) (< v_idx_375 v_b_139_4)) (<= (+ v_b_134_4 2) v_b_138_4) (<= .cse3 c_ULTIMATE.start_main_p3) (<= (+ v_b_135_4 1) v_b_138_4) (<= .cse4 v_b_138_4) (or (= (select |c_#memory_int| v_idx_373) v_v_1320_4) (< v_idx_373 .cse4) (<= v_b_138_4 v_idx_373)) (<= .cse2 v_b_135_4))))) is different from false [2019-01-18 18:09:39,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_379 Int) (v_idx_377 Int) (v_idx_378 Int) (v_idx_382 Int) (v_idx_383 Int) (v_idx_380 Int) (v_idx_381 Int) (v_idx_376 Int) (v_idx_384 Int)) (exists ((v_v_1319_4 Int) (v_v_1318_4 Int) (v_v_1320_4 Int) (v_b_135_4 Int) (v_b_136_4 Int) (v_v_1322_4 Int) (v_b_134_4 Int) (v_b_139_4 Int) (v_v_1316_4 Int) (v_b_137_4 Int) (v_v_1314_4 Int) (v_b_138_4 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 3)) (.cse4 (+ v_b_134_4 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ v_b_138_4 1)) (.cse2 (+ v_b_134_4 2)) (.cse6 (+ v_b_136_4 1)) (.cse7 (+ v_b_135_4 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 2))) (and (<= 0 v_v_1319_4) (or (<= .cse0 v_idx_377) (< v_idx_377 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_377))) (or (<= c_ULTIMATE.start_main_p1 v_idx_376) (= (select |c_#memory_int| v_idx_376) v_v_1314_4)) (<= 0 (* 2 v_v_1319_4)) (<= (+ v_b_137_4 1) v_b_139_4) (<= .cse1 v_b_138_4) (<= .cse2 v_b_137_4) (or (< v_idx_379 v_b_134_4) (<= v_b_135_4 v_idx_379) (= 0 (select |c_#memory_int| v_idx_379))) (<= .cse1 v_b_137_4) (or (= 0 (select |c_#memory_int| v_idx_383)) (< v_idx_383 v_b_138_4) (<= v_b_139_4 v_idx_383)) (or (= (select |c_#memory_int| v_idx_384) v_v_1322_4) (< v_idx_384 v_b_139_4)) (<= .cse3 v_b_139_4) (or (< v_idx_380 v_b_135_4) (= (select |c_#memory_int| v_idx_380) v_v_1318_4) (<= v_b_136_4 v_idx_380)) (<= (+ v_b_134_4 3) v_b_139_4) (<= .cse0 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (<= v_b_135_4 v_b_136_4) (<= .cse4 v_b_135_4) (<= v_b_135_4 .cse4) (<= .cse4 v_b_136_4) (<= .cse5 v_b_136_4) (<= v_b_137_4 .cse6) (or (<= v_b_134_4 v_idx_378) (< v_idx_378 .cse0) (= (select |c_#memory_int| v_idx_378) v_v_1316_4)) (<= .cse6 v_b_137_4) (<= v_b_139_4 .cse3) (<= (+ v_b_135_4 2) v_b_139_4) (<= (+ v_b_136_4 2) v_b_139_4) (<= v_b_137_4 v_b_138_4) (<= .cse7 v_b_137_4) (or (= (select |c_#memory_int| v_idx_381) v_v_1319_4) (< v_idx_381 v_b_136_4) (<= v_b_137_4 v_idx_381)) (<= .cse2 v_b_138_4) (<= .cse6 v_b_138_4) (<= .cse7 v_b_138_4) (<= .cse5 v_b_135_4) (or (<= v_b_138_4 v_idx_382) (= (select |c_#memory_int| v_idx_382) v_v_1320_4) (< v_idx_382 v_b_137_4)))))) is different from false [2019-01-18 18:09:39,469 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:09:39,469 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:09:39,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:09:39,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:09:39,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:39,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:09:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:09:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:09:39,470 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 4 states. [2019-01-18 18:09:42,050 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_368 Int) (v_idx_369 Int) (v_idx_367 Int) (v_idx_371 Int) (v_idx_372 Int) (v_idx_370 Int) (v_idx_375 Int) (v_idx_373 Int) (v_idx_374 Int)) (exists ((v_v_1319_4 Int) (v_v_1318_4 Int) (v_v_1320_4 Int) (v_b_135_4 Int) (v_v_1322_4 Int) (v_b_134_4 Int) (v_b_139_4 Int) (v_v_1316_4 Int) (v_v_1314_4 Int) (v_b_138_4 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ v_b_138_4 1)) (.cse3 (+ v_b_134_4 1)) (.cse4 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 2))) (and (<= 0 v_v_1319_4) (or (<= c_ULTIMATE.start_main_p1 v_idx_367) (= (select |c_#memory_int| v_idx_367) v_v_1314_4)) (or (= (select |c_#memory_int| v_idx_369) v_v_1316_4) (< v_idx_369 .cse0) (<= v_b_134_4 v_idx_369)) (<= 0 (* 2 v_v_1319_4)) (<= (+ c_ULTIMATE.start_main_p3 2) v_b_139_4) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_138_4) (or (<= c_ULTIMATE.start_main_p3 v_idx_371) (< v_idx_371 v_b_135_4) (= (select |c_#memory_int| v_idx_371) v_v_1318_4)) (<= v_b_135_4 c_ULTIMATE.start_main_p3) (<= .cse1 v_b_139_4) (or (<= v_b_139_4 v_idx_374) (= 0 (select |c_#memory_int| v_idx_374)) (< v_idx_374 v_b_138_4)) (<= (+ v_b_134_4 3) v_b_139_4) (<= .cse0 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (<= .cse2 c_ULTIMATE.start_main_p3) (<= .cse3 v_b_135_4) (<= v_b_135_4 .cse3) (or (<= v_b_135_4 v_idx_370) (< v_idx_370 v_b_134_4) (= 0 (select |c_#memory_int| v_idx_370))) (or (< v_idx_372 c_ULTIMATE.start_main_p3) (<= .cse4 v_idx_372) (= (select |c_#memory_int| v_idx_372) v_v_1319_4)) (or (= 0 (select |c_#memory_int| v_idx_368)) (<= .cse0 v_idx_368) (< v_idx_368 c_ULTIMATE.start_main_p1)) (<= v_b_139_4 .cse1) (<= (+ v_b_135_4 2) v_b_139_4) (or (= (select |c_#memory_int| v_idx_375) v_v_1322_4) (< v_idx_375 v_b_139_4)) (<= (+ v_b_134_4 2) v_b_138_4) (<= .cse3 c_ULTIMATE.start_main_p3) (<= (+ v_b_135_4 1) v_b_138_4) (<= .cse4 v_b_138_4) (or (= (select |c_#memory_int| v_idx_373) v_v_1320_4) (< v_idx_373 .cse4) (<= v_b_138_4 v_idx_373)) (<= .cse2 v_b_135_4))))) (forall ((v_idx_379 Int) (v_idx_377 Int) (v_idx_378 Int) (v_idx_382 Int) (v_idx_383 Int) (v_idx_380 Int) (v_idx_381 Int) (v_idx_376 Int) (v_idx_384 Int)) (exists ((v_v_1319_4 Int) (v_v_1318_4 Int) (v_v_1320_4 Int) (v_b_135_4 Int) (v_b_136_4 Int) (v_v_1322_4 Int) (v_b_134_4 Int) (v_b_139_4 Int) (v_v_1316_4 Int) (v_b_137_4 Int) (v_v_1314_4 Int) (v_b_138_4 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p1 3)) (.cse9 (+ v_b_134_4 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1)) (.cse8 (+ v_b_138_4 1)) (.cse7 (+ v_b_134_4 2)) (.cse11 (+ v_b_136_4 1)) (.cse12 (+ v_b_135_4 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 2))) (and (<= 0 v_v_1319_4) (or (<= .cse5 v_idx_377) (< v_idx_377 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_377))) (or (<= c_ULTIMATE.start_main_p1 v_idx_376) (= (select |c_#memory_int| v_idx_376) v_v_1314_4)) (<= 0 (* 2 v_v_1319_4)) (<= (+ v_b_137_4 1) v_b_139_4) (<= .cse6 v_b_138_4) (<= .cse7 v_b_137_4) (or (< v_idx_379 v_b_134_4) (<= v_b_135_4 v_idx_379) (= 0 (select |c_#memory_int| v_idx_379))) (<= .cse6 v_b_137_4) (or (= 0 (select |c_#memory_int| v_idx_383)) (< v_idx_383 v_b_138_4) (<= v_b_139_4 v_idx_383)) (or (= (select |c_#memory_int| v_idx_384) v_v_1322_4) (< v_idx_384 v_b_139_4)) (<= .cse8 v_b_139_4) (or (< v_idx_380 v_b_135_4) (= (select |c_#memory_int| v_idx_380) v_v_1318_4) (<= v_b_136_4 v_idx_380)) (<= (+ v_b_134_4 3) v_b_139_4) (<= .cse5 v_b_134_4) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_139_4) (<= v_b_135_4 v_b_136_4) (<= .cse9 v_b_135_4) (<= v_b_135_4 .cse9) (<= .cse9 v_b_136_4) (<= .cse10 v_b_136_4) (<= v_b_137_4 .cse11) (or (<= v_b_134_4 v_idx_378) (< v_idx_378 .cse5) (= (select |c_#memory_int| v_idx_378) v_v_1316_4)) (<= .cse11 v_b_137_4) (<= v_b_139_4 .cse8) (<= (+ v_b_135_4 2) v_b_139_4) (<= (+ v_b_136_4 2) v_b_139_4) (<= v_b_137_4 v_b_138_4) (<= .cse12 v_b_137_4) (or (= (select |c_#memory_int| v_idx_381) v_v_1319_4) (< v_idx_381 v_b_136_4) (<= v_b_137_4 v_idx_381)) (<= .cse7 v_b_138_4) (<= .cse11 v_b_138_4) (<= .cse12 v_b_138_4) (<= .cse10 v_b_135_4) (or (<= v_b_138_4 v_idx_382) (= (select |c_#memory_int| v_idx_382) v_v_1320_4) (< v_idx_382 v_b_137_4))))))) is different from false [2019-01-18 18:09:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:55,689 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-01-18 18:09:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:09:55,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:09:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:55,690 INFO L225 Difference]: With dead ends: 14 [2019-01-18 18:09:55,690 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 18:09:55,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:09:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 18:09:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-18 18:09:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 18:09:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-01-18 18:09:55,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-01-18 18:09:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:55,699 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-01-18 18:09:55,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:09:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-18 18:09:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:09:55,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:55,700 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-18 18:09:55,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash 939412, now seen corresponding path program 2 times [2019-01-18 18:09:55,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:55,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:55,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:55,766 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-18 18:09:55,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:55,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:55,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:55,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:55,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:55,768 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-18 18:09:55,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:09:55,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:09:55,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:09:55,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:55,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:55,823 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 15 treesize of output 18 [2019-01-18 18:09:55,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:55,865 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 18:09:55,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:55,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:55,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:09:55,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:55,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:55,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:55,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 18:09:55,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:55,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:56,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:56,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:56,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:56,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-18 18:09:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:09:56,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:56,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:56,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-18 18:09:56,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:56,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-18 18:09:56,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:56,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:56,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-18 18:09:56,538 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-18 18:09:56,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:56,565 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-18 18:09:56,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 18:09:56,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 18:09:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 18:09:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:09:56,586 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 7 states. [2019-01-18 18:09:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:56,968 INFO L93 Difference]: Finished difference Result 37 states and 58 transitions. [2019-01-18 18:09:56,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:09:56,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-18 18:09:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:56,970 INFO L225 Difference]: With dead ends: 37 [2019-01-18 18:09:56,970 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 18:09:56,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:09:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 18:09:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2019-01-18 18:09:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 18:09:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2019-01-18 18:09:56,983 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 36 transitions. Word has length 4 [2019-01-18 18:09:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:56,984 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 36 transitions. [2019-01-18 18:09:56,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 18:09:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 36 transitions. [2019-01-18 18:09:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:09:56,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:56,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:09:56,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-18 18:09:56,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:56,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:56,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:56,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:56,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:57,053 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-18 18:09:57,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:57,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:57,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:09:57,054 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-18 18:09:57,055 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:57,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:04,241 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:10:04,242 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 18:10:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:04,242 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:10:04,641 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-18 18:10:04,642 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:10:07,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_510 Int) (v_idx_504 Int) (v_idx_505 Int) (v_idx_502 Int) (v_idx_503 Int) (v_idx_508 Int) (v_idx_509 Int) (v_idx_506 Int) (v_idx_507 Int)) (exists ((v_v_1638_5 Int) (v_b_142_5 Int) (v_v_1639_5 Int) (v_v_1636_5 Int) (v_v_1634_5 Int) (v_b_143_5 Int) (v_v_1632_5 Int) (v_v_1640_5 Int)) (let ((.cse2 (+ c_ULTIMATE.start_main_p4 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ v_b_142_5 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 3)) (.cse4 (+ c_ULTIMATE.start_main_p2 2))) (and (<= .cse0 v_b_143_5) (<= v_v_1639_5 0) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_142_5) (<= .cse1 v_b_142_5) (or (< v_idx_509 c_ULTIMATE.start_main_p4) (<= .cse2 v_idx_509) (= (select |c_#memory_int| v_idx_509) v_v_1639_5)) (or (< v_idx_504 .cse3) (= (select |c_#memory_int| v_idx_504) v_v_1634_5) (<= c_ULTIMATE.start_main_p2 v_idx_504)) (<= v_b_143_5 c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p4) (or (< v_idx_510 .cse2) (= (select |c_#memory_int| v_idx_510) v_v_1640_5)) (or (<= .cse3 v_idx_503) (= 0 (select |c_#memory_int| v_idx_503)) (< v_idx_503 c_ULTIMATE.start_main_p1)) (or (= (select |c_#memory_int| v_idx_502) v_v_1632_5) (<= c_ULTIMATE.start_main_p1 v_idx_502)) (or (<= .cse1 v_idx_505) (= 0 (select |c_#memory_int| v_idx_505)) (< v_idx_505 c_ULTIMATE.start_main_p2)) (<= .cse5 v_b_143_5) (<= .cse0 c_ULTIMATE.start_main_p4) (or (< v_idx_506 .cse1) (<= v_b_142_5 v_idx_506) (= (select |c_#memory_int| v_idx_506) v_v_1636_5)) (or (< v_idx_507 v_b_142_5) (= 0 (select |c_#memory_int| v_idx_507)) (<= v_b_143_5 v_idx_507)) (<= (* 2 v_v_1639_5) 0) (<= .cse3 c_ULTIMATE.start_main_p2) (<= v_b_143_5 .cse0) (<= .cse5 c_ULTIMATE.start_main_p4) (<= .cse4 v_b_143_5) (or (< v_idx_508 v_b_143_5) (<= c_ULTIMATE.start_main_p4 v_idx_508) (= (select |c_#memory_int| v_idx_508) v_v_1638_5)))))) is different from false [2019-01-18 18:10:09,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_511 Int) (v_idx_512 Int) (v_idx_515 Int) (v_idx_516 Int) (v_idx_513 Int) (v_idx_514 Int) (v_idx_519 Int) (v_idx_517 Int) (v_idx_518 Int)) (exists ((v_v_1638_5 Int) (v_v_1639_5 Int) (v_b_142_5 Int) (v_v_1636_5 Int) (v_b_145_5 Int) (v_v_1634_5 Int) (v_b_143_5 Int) (v_v_1632_5 Int) (v_b_144_5 Int) (v_v_1640_5 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p1 3)) (.cse1 (+ c_ULTIMATE.start_main_p2 2)) (.cse2 (+ v_b_144_5 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ v_b_142_5 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 1))) (and (<= v_v_1639_5 0) (or (< v_idx_514 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_514)) (<= .cse0 v_idx_514)) (or (= (select |c_#memory_int| v_idx_518) v_v_1639_5) (< v_idx_518 v_b_144_5) (<= v_b_145_5 v_idx_518)) (<= .cse1 v_b_144_5) (<= v_b_145_5 .cse2) (<= (+ v_b_142_5 2) v_b_145_5) (<= .cse3 v_b_144_5) (<= .cse3 v_b_143_5) (or (<= c_ULTIMATE.start_main_p1 v_idx_511) (= (select |c_#memory_int| v_idx_511) v_v_1632_5)) (<= (+ c_ULTIMATE.start_main_p1 4) v_b_145_5) (<= (* 2 v_v_1639_5) 0) (<= v_b_143_5 .cse4) (<= v_b_143_5 v_b_144_5) (or (= (select |c_#memory_int| v_idx_513) v_v_1634_5) (<= c_ULTIMATE.start_main_p2 v_idx_513) (< v_idx_513 .cse5)) (<= .cse1 v_b_143_5) (<= .cse4 v_b_143_5) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_142_5) (<= .cse0 v_b_142_5) (<= (+ c_ULTIMATE.start_main_p2 3) v_b_145_5) (<= .cse2 v_b_145_5) (or (< v_idx_517 v_b_143_5) (<= v_b_144_5 v_idx_517) (= (select |c_#memory_int| v_idx_517) v_v_1638_5)) (or (= (select |c_#memory_int| v_idx_515) v_v_1636_5) (< v_idx_515 .cse0) (<= v_b_142_5 v_idx_515)) (<= .cse4 v_b_144_5) (or (<= .cse5 v_idx_512) (< v_idx_512 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_512) 0)) (or (< v_idx_516 v_b_142_5) (= (select |c_#memory_int| v_idx_516) 0) (<= v_b_143_5 v_idx_516)) (<= .cse5 c_ULTIMATE.start_main_p2) (<= (+ v_b_143_5 1) v_b_145_5) (or (= (select |c_#memory_int| v_idx_519) v_v_1640_5) (< v_idx_519 v_b_145_5)))))) is different from false [2019-01-18 18:10:12,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_522 Int) (v_idx_523 Int) (v_idx_520 Int) (v_idx_521 Int) (v_idx_526 Int) (v_idx_527 Int) (v_idx_524 Int) (v_idx_525 Int) (v_idx_528 Int)) (exists ((v_b_172_5 Int) (v_v_1638_5 Int) (v_v_1639_5 Int) (v_b_142_5 Int) (v_v_1636_5 Int) (v_b_145_5 Int) (v_v_1634_5 Int) (v_b_143_5 Int) (v_v_1632_5 Int) (v_b_144_5 Int) (v_b_139_5 Int) (v_v_1640_5 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p2 2)) (.cse3 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ v_b_144_5 1)) (.cse6 (+ v_b_139_5 2)) (.cse5 (+ v_b_172_5 3)) (.cse0 (+ v_b_172_5 1)) (.cse4 (+ v_b_142_5 1))) (and (<= v_v_1639_5 0) (<= .cse0 c_ULTIMATE.start_main_p2) (or (<= v_b_145_5 v_idx_527) (< v_idx_527 v_b_144_5) (= (select |c_#memory_int| v_idx_527) v_v_1639_5)) (or (< v_idx_528 v_b_145_5) (= (select |c_#memory_int| v_idx_528) v_v_1640_5)) (<= (+ v_b_172_5 2) v_b_142_5) (<= .cse1 v_b_144_5) (<= v_b_145_5 .cse2) (<= (+ v_b_142_5 2) v_b_145_5) (or (< v_idx_521 v_b_172_5) (<= v_b_139_5 v_idx_521) (= (select |c_#memory_int| v_idx_521) 0)) (<= .cse0 v_b_139_5) (or (<= v_b_143_5 v_idx_525) (= (select |c_#memory_int| v_idx_525) 0) (< v_idx_525 v_b_142_5)) (<= (* 2 v_v_1639_5) 0) (or (<= .cse3 v_idx_523) (< v_idx_523 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_523) 0)) (<= v_b_143_5 .cse4) (<= .cse5 v_b_144_5) (<= v_b_143_5 v_b_144_5) (<= .cse1 v_b_143_5) (<= .cse4 v_b_143_5) (<= (+ v_b_139_5 3) v_b_145_5) (<= .cse3 v_b_142_5) (or (<= v_b_142_5 v_idx_524) (= (select |c_#memory_int| v_idx_524) v_v_1636_5) (< v_idx_524 .cse3)) (or (= (select |c_#memory_int| v_idx_526) v_v_1638_5) (<= v_b_144_5 v_idx_526) (< v_idx_526 v_b_143_5)) (<= (+ c_ULTIMATE.start_main_p2 3) v_b_145_5) (<= .cse6 v_b_144_5) (or (= (select |c_#memory_int| v_idx_522) v_v_1634_5) (< v_idx_522 v_b_139_5) (<= c_ULTIMATE.start_main_p2 v_idx_522)) (<= .cse2 v_b_145_5) (<= .cse6 v_b_143_5) (<= v_b_139_5 c_ULTIMATE.start_main_p2) (<= (+ v_b_172_5 4) v_b_145_5) (<= .cse5 v_b_143_5) (<= v_b_139_5 .cse0) (<= .cse4 v_b_144_5) (<= (+ v_b_139_5 1) v_b_142_5) (or (<= v_b_172_5 v_idx_520) (= (select |c_#memory_int| v_idx_520) v_v_1632_5)) (<= (+ v_b_143_5 1) v_b_145_5))))) is different from false [2019-01-18 18:10:12,259 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-18 18:10:12,259 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:10:12,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:10:12,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-18 18:10:12,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:10:12,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:10:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:10:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:10:12,260 INFO L87 Difference]: Start difference. First operand 16 states and 36 transitions. Second operand 5 states. [2019-01-18 18:10:13,656 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-18 18:10:13,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-18 18:10:13,657 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner$AbsIntPredicateUnifier.getOrConstructPredicateForConjunction(CegarAbsIntRunner.java:698) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 44 more [2019-01-18 18:10:13,661 INFO L168 Benchmark]: Toolchain (without parser) took 153469.12 ms. Allocated memory was 140.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 107.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 561.2 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:13,664 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 18:10:13,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.15 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:13,665 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 103.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:13,666 INFO L168 Benchmark]: RCFGBuilder took 360.29 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 93.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:13,667 INFO L168 Benchmark]: TraceAbstraction took 153004.10 ms. Allocated memory was 140.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 93.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 546.8 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:13,679 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.20 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.15 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.23 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 103.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.29 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 93.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 153004.10 ms. Allocated memory was 140.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 93.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 546.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...