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-0302a3f [2019-02-25 15:51:35,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:51:35,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:51:35,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:51:35,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:51:35,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:51:35,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:51:35,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:51:35,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:51:35,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:51:35,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:51:35,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:51:35,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:51:35,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:51:35,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:51:35,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:51:35,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:51:35,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:51:35,345 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:51:35,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:51:35,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:51:35,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:51:35,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:51:35,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:51:35,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:51:35,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:51:35,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:51:35,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:51:35,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:51:35,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:51:35,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:51:35,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:51:35,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:51:35,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:51:35,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:51:35,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:51:35,360 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-02-25 15:51:35,383 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:51:35,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:51:35,385 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:51:35,385 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:51:35,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:51:35,385 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:51:35,385 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:51:35,386 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:51:35,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:51:35,386 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:51:35,386 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:51:35,386 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:51:35,387 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:51:35,387 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:51:35,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:51:35,388 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:51:35,388 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:51:35,388 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:51:35,388 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:51:35,389 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:51:35,389 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:51:35,389 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:51:35,389 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:51:35,389 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:51:35,390 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:51:35,390 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:51:35,390 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:51:35,390 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:51:35,390 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:51:35,391 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:51:35,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:35,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:51:35,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:51:35,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:51:35,392 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:51:35,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:51:35,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:51:35,392 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:51:35,392 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:51:35,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:51:35,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:51:35,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:51:35,448 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:51:35,448 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:51:35,449 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-02-25 15:51:35,449 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-25 15:51:35,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:51:35,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:51:35,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:35,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:51:35,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:51:35,513 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,528 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:35,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:51:35,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:51:35,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:51:35,573 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,574 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,576 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,576 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,581 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,586 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,587 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 25.02 03:51:35" (1/1) ... [2019-02-25 15:51:35,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:51:35,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:51:35,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:51:35,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:51:35,593 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 25.02 03:51:35" (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-02-25 15:51:35,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:51:35,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:51:35,952 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:51:35,952 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-25 15:51:35,955 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:35 BoogieIcfgContainer [2019-02-25 15:51:35,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:51:35,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:51:35,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:51:35,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:51:35,961 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 25.02 03:51:35" (1/2) ... [2019-02-25 15:51:35,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9d474b and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:51:35, skipping insertion in model container [2019-02-25 15:51:35,963 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 25.02 03:51:35" (2/2) ... [2019-02-25 15:51:35,964 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-25 15:51:35,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:51:35,984 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-25 15:51:36,002 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-25 15:51:36,041 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:51:36,041 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:51:36,041 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:51:36,041 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:51:36,042 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:51:36,042 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:51:36,042 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:51:36,042 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:51:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-25 15:51:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:51:36,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:36,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:51:36,074 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:36,081 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-25 15:51:36,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:36,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:36,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:36,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:36,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:36,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:36,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:36,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:36,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:36,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:36,361 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-25 15:51:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:36,580 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-25 15:51:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:36,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:51:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:36,596 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:51:36,596 INFO L226 Difference]: Without dead ends: 16 [2019-02-25 15:51:36,600 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-02-25 15:51:36,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-25 15:51:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-25 15:51:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:51:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-25 15:51:36,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-25 15:51:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:36,636 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-25 15:51:36,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-25 15:51:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:36,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:36,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:36,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:36,638 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-25 15:51:36,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:36,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:36,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:36,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:36,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:36,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:36,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:36,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:36,766 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-25 15:51:36,822 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:36,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:46,148 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:51:46,150 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-02-25 15:51:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:46,155 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:51:47,503 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-02-25 15:51:47,504 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:51:48,654 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-25 15:51:48,655 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:51:48,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:51:48,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-25 15:51:48,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:48,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:48,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:48,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:51:48,660 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2019-02-25 15:52:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:00,162 INFO L93 Difference]: Finished difference Result 14 states and 27 transitions. [2019-02-25 15:52:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:00,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:52:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:00,164 INFO L225 Difference]: With dead ends: 14 [2019-02-25 15:52:00,164 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:52:00,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:52:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-25 15:52:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:52:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2019-02-25 15:52:00,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 22 transitions. Word has length 3 [2019-02-25 15:52:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:00,171 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 22 transitions. [2019-02-25 15:52:00,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 22 transitions. [2019-02-25 15:52:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:00,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:00,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:00,173 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-25 15:52:00,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:52:00,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:52:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:52:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:00,257 INFO L87 Difference]: Start difference. First operand 11 states and 22 transitions. Second operand 3 states. [2019-02-25 15:52:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:00,469 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-25 15:52:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:00,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:52:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:00,471 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:52:00,471 INFO L226 Difference]: Without dead ends: 16 [2019-02-25 15:52:00,474 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-02-25 15:52:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-25 15:52:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-02-25 15:52:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:52:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 23 transitions. [2019-02-25 15:52:00,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 23 transitions. Word has length 3 [2019-02-25 15:52:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:00,481 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 23 transitions. [2019-02-25 15:52:00,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:52:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-02-25 15:52:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:00,484 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:00,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:00,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-25 15:52:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:00,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:00,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:00,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:00,650 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-25 15:52:00,654 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:00,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:05,977 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:52:05,978 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-02-25 15:52:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,978 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:52:08,178 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2019-02-25 15:52:08,179 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:52:09,451 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-25 15:52:09,452 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:52:09,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:52:09,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-25 15:52:09,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:09,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:52:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:52:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:09,453 INFO L87 Difference]: Start difference. First operand 12 states and 23 transitions. Second operand 3 states. [2019-02-25 15:52:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:09,702 INFO L93 Difference]: Finished difference Result 14 states and 29 transitions. [2019-02-25 15:52:09,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:09,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:52:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:09,703 INFO L225 Difference]: With dead ends: 14 [2019-02-25 15:52:09,703 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:52:09,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:52:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:52:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:52:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2019-02-25 15:52:09,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 28 transitions. Word has length 3 [2019-02-25 15:52:09,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:09,709 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 28 transitions. [2019-02-25 15:52:09,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:52:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 28 transitions. [2019-02-25 15:52:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:09,710 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:09,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:09,711 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-25 15:52:09,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:09,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:09,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:09,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:09,905 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-25 15:52:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:09,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:09,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:09,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:09,918 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-25 15:52:09,924 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:09,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:15,374 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:52:15,375 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-02-25 15:52:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:15,375 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:52:16,286 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-02-25 15:52:16,286 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:52:17,285 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-25 15:52:17,285 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:52:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:52:17,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-25 15:52:17,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:17,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:17,287 INFO L87 Difference]: Start difference. First operand 13 states and 28 transitions. Second operand 4 states. [2019-02-25 15:52:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:17,849 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-25 15:52:17,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:17,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:52:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:17,850 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:52:17,850 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:52:17,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:52:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-25 15:52:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:52:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2019-02-25 15:52:17,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 33 transitions. Word has length 3 [2019-02-25 15:52:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:17,857 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 33 transitions. [2019-02-25 15:52:17,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 33 transitions. [2019-02-25 15:52:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:17,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:17,857 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-02-25 15:52:17,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 939412, now seen corresponding path program 2 times [2019-02-25 15:52:17,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:17,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:17,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:17,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:17,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:17,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:17,933 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-02-25 15:52:17,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:17,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:17,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:52:17,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:17,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:52:17,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:18,009 INFO L467 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-02-25 15:52:18,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,025 INFO L467 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-02-25 15:52:18,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,082 INFO L467 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-02-25 15:52:18,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,173 INFO L467 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-02-25 15:52:18,174 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,441 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,583 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,707 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,909 INFO L301 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-02-25 15:52:18,909 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-25 15:52:19,061 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-02-25 15:52:19,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,261 INFO L292 Elim1Store]: Index analysis took 196 ms [2019-02-25 15:52:19,262 INFO L467 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-02-25 15:52:19,263 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,611 INFO L301 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-02-25 15:52:19,611 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-25 15:52:19,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,762 INFO L467 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 45 [2019-02-25 15:52:19,763 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,072 INFO L301 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-02-25 15:52:20,073 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-02-25 15:52:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:20,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:52:20,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:20,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:52:20,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:52:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:20,231 INFO L87 Difference]: Start difference. First operand 14 states and 33 transitions. Second operand 7 states. [2019-02-25 15:52:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:20,590 INFO L93 Difference]: Finished difference Result 39 states and 64 transitions. [2019-02-25 15:52:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:20,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-25 15:52:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:20,591 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:52:20,591 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:52:20,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:52:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 18. [2019-02-25 15:52:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:52:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-02-25 15:52:20,599 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 4 [2019-02-25 15:52:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:20,599 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-02-25 15:52:20,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:52:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-02-25 15:52:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:20,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:20,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:20,600 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-25 15:52:20,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:20,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:20,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:20,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:20,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:20,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:20,677 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-25 15:52:20,678 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:20,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:27,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:52:27,361 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-02-25 15:52:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:27,362 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:52:29,128 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-02-25 15:52:29,128 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:52:31,296 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-25 15:52:31,297 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:52:31,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:52:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-02-25 15:52:31,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:31,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:52:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:52:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:52:31,299 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-02-25 15:52:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:42,027 INFO L93 Difference]: Finished difference Result 19 states and 42 transitions. [2019-02-25 15:52:42,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:42,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-25 15:52:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:42,028 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:52:42,028 INFO L226 Difference]: Without dead ends: 18 [2019-02-25 15:52:42,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:52:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-25 15:52:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-25 15:52:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:52:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 40 transitions. [2019-02-25 15:52:42,035 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 40 transitions. Word has length 4 [2019-02-25 15:52:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:42,036 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 40 transitions. [2019-02-25 15:52:42,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:52:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 40 transitions. [2019-02-25 15:52:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:42,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:42,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:42,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,037 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-02-25 15:52:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:42,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:42,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:42,144 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-25 15:52:42,145 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:42,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:54,722 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:52:54,723 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:54,723 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:52:57,522 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 70.83% of their original sizes. [2019-02-25 15:52:57,522 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:52:59,764 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_555 Int) (v_idx_556 Int) (v_idx_553 Int) (v_idx_554 Int) (v_idx_557 Int) (v_idx_551 Int) (v_idx_552 Int)) (let ((.cse51 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse37 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (<= .cse51 c_ULTIMATE.start_main_p4))) (and (let ((.cse50 (+ c_ULTIMATE.start_main_p1 2)) (.cse52 (+ v_idx_554 2)) (.cse53 (+ v_idx_553 3))) (let ((.cse49 (+ v_idx_556 1)) (.cse41 (<= .cse53 v_idx_555)) (.cse24 (<= .cse53 c_ULTIMATE.start_main_p4)) (.cse44 (<= (+ v_idx_553 2) v_idx_554)) (.cse48 (<= .cse52 v_idx_555)) (.cse9 (<= .cse52 c_ULTIMATE.start_main_p4)) (.cse39 (<= .cse51 v_idx_555)) (.cse47 (<= (+ v_idx_555 1) v_idx_554)) (.cse42 (<= (+ v_idx_555 2) c_ULTIMATE.start_main_p4)) (.cse43 (= (select |c_#memory_int| v_idx_555) 0)) (.cse46 (<= .cse50 v_idx_554))) (let ((.cse17 (or (and .cse39 .cse46 .cse2) (and .cse46 .cse2 .cse47 .cse42) (and .cse43 .cse46 .cse2))) (.cse16 (or (and .cse2 .cse42) (and .cse39 .cse2) (and .cse43 .cse2))) (.cse29 (<= (+ v_idx_554 1) v_idx_553)) (.cse30 (<= .cse50 v_idx_553)) (.cse18 (or (and .cse2 .cse42 .cse9) (and .cse48 .cse39 .cse2 .cse9) (and .cse43 .cse2 .cse9))) (.cse35 (or (and .cse24 .cse39 .cse41 .cse44 .cse46 .cse2) (and .cse24 .cse43 .cse44 .cse46 .cse2) (and .cse24 .cse44 .cse46 .cse2 .cse47 .cse42))) (.cse34 (or (and .cse24 .cse48 .cse39 .cse41 .cse2 .cse9) (and .cse24 .cse2 .cse42 .cse9) (and .cse24 .cse43 .cse2 .cse9))) (.cse33 (or (and .cse24 .cse39 .cse41 .cse2) (and .cse24 .cse43 .cse2) (and .cse24 .cse2 .cse42))) (.cse38 (<= .cse49 v_idx_555)) (.cse40 (<= .cse49 c_ULTIMATE.start_main_p4)) (.cse45 (<= v_idx_556 v_idx_554))) (let ((.cse11 (or (and .cse38 .cse39 .cse40 .cse45 .cse46 .cse2) (and .cse43 .cse40 .cse45 .cse46 .cse2) (and .cse40 .cse45 .cse46 .cse2 .cse47 .cse42))) (.cse10 (or (and .cse43 .cse40 .cse2) (and .cse40 .cse2 .cse42) (and .cse38 .cse39 .cse40 .cse2))) (.cse7 (or (and .cse40 .cse2 .cse42 .cse9) (and .cse48 .cse38 .cse39 .cse40 .cse2 .cse9) (and .cse43 .cse40 .cse2 .cse9))) (.cse25 (<= (+ v_idx_553 1) v_idx_552)) (.cse32 (or (and .cse35 .cse24 .cse2) (and .cse24 .cse2 .cse34 .cse9) (and .cse24 .cse33 .cse2))) (.cse12 (< v_idx_552 .cse37)) (.cse27 (or (and .cse24 .cse48 .cse38 .cse39 .cse40 .cse41 .cse2 .cse9) (and .cse24 .cse40 .cse2 .cse42 .cse9) (and .cse24 .cse43 .cse40 .cse2 .cse9))) (.cse26 (or (and .cse24 .cse43 .cse40 .cse44 .cse45 .cse46 .cse2) (and .cse24 .cse40 .cse44 .cse45 .cse46 .cse2 .cse47 .cse42) (and .cse24 .cse38 .cse39 .cse40 .cse41 .cse44 .cse45 .cse46 .cse2))) (.cse28 (or (and .cse24 .cse38 .cse39 .cse40 .cse41 .cse2) (and .cse24 .cse40 .cse2 .cse42) (and .cse24 .cse43 .cse40 .cse2))) (.cse8 (<= v_idx_554 v_idx_552)) (.cse6 (<= .cse37 v_idx_552)) (.cse36 (or (and .cse30 .cse17 .cse2) (and .cse30 .cse16 .cse2) (and .cse29 .cse30 .cse2 .cse9 .cse18)))) (let ((.cse0 (and .cse36 .cse2)) (.cse21 (and (or (and .cse30 .cse17 .cse6 .cse2) (and .cse30 .cse16 .cse6 .cse2) (and .cse29 .cse30 .cse6 .cse2 .cse8 .cse9 .cse18)) .cse6 .cse2)) (.cse23 (or (and .cse24 .cse27 .cse2 .cse9) (and .cse24 .cse26 .cse2) (and .cse24 .cse28 .cse2))) (.cse20 (and .cse36 .cse12 .cse2)) (.cse31 (and .cse24 .cse12 .cse32 .cse2)) (.cse19 (and .cse24 .cse25 (or (and .cse24 .cse25 .cse33 .cse6 .cse2) (and .cse24 .cse25 .cse6 .cse2 .cse8 .cse34 .cse9) (and .cse35 .cse24 .cse25 .cse6 .cse2)) .cse6 .cse2)) (.cse22 (and .cse24 .cse32 .cse2)) (.cse14 (<= c_ULTIMATE.start_main_p4 v_idx_556)) (.cse1 (or (and .cse30 .cse11 .cse2) (and .cse10 .cse30 .cse2) (and .cse29 .cse30 .cse7 .cse2 .cse9)))) (or .cse0 (and .cse1 .cse2) (and (let ((.cse15 (or (and .cse2 .cse9 .cse18) (and .cse16 .cse2) (and .cse17 .cse2)))) (let ((.cse3 (or (and .cse10 .cse2) (and .cse7 .cse2 .cse9) (and .cse11 .cse2))) (.cse4 (and .cse15 .cse2)) (.cse5 (and (or (and .cse16 .cse6 .cse2) (and .cse17 .cse6 .cse2) (and .cse6 .cse2 .cse8 .cse9 .cse18)) .cse6 .cse2)) (.cse13 (and .cse12 .cse15 .cse2))) (or (and .cse3 .cse2) .cse4 .cse5 (and (or (and .cse6 .cse7 .cse2 .cse8 .cse9) (and .cse10 .cse6 .cse2) (and .cse11 .cse6 .cse2)) .cse6 .cse2) (and .cse3 .cse12 .cse2) (and (or .cse4 .cse5 .cse13) .cse14) .cse13))) (= (select |c_#memory_int| v_idx_553) 0)) .cse19 (and (or .cse0 .cse20 .cse21) .cse14) .cse22 (and .cse23 .cse24 .cse2) .cse21 (and .cse24 .cse25 (or (and .cse24 .cse25 .cse26 .cse6 .cse2) (and .cse24 .cse25 .cse27 .cse6 .cse2 .cse8 .cse9) (and .cse24 .cse25 .cse6 .cse28 .cse2)) .cse6 .cse2) (and .cse23 .cse24 .cse12 .cse2) (and .cse6 (or (and .cse29 .cse30 .cse6 .cse7 .cse2 .cse8 .cse9) (and .cse10 .cse30 .cse6 .cse2) (and .cse30 .cse11 .cse6 .cse2)) .cse2) .cse31 .cse20 (and (or .cse31 .cse19 .cse22) .cse14) (and .cse12 .cse1 .cse2))))))) (let ((.cse58 (select |c_#memory_int| v_idx_557))) (let ((.cse57 (<= (* 2 .cse58) 0)) (.cse60 (<= .cse58 0)) (.cse55 (< v_idx_557 c_ULTIMATE.start_main_p4)) (.cse56 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_557))) (let ((.cse54 (or (and .cse57 .cse60) .cse55 .cse56))) (or (and .cse54 (< v_idx_551 c_ULTIMATE.start_main_p1)) (and (<= .cse37 v_idx_551) .cse54) (let ((.cse59 (select |c_#memory_int| v_idx_551))) (and (or .cse55 .cse56 (and .cse57 (<= .cse58 .cse59) .cse60)) (<= 0 (* 2 .cse59)) (<= 0 .cse59))))))) .cse2)))) is different from false [2019-02-25 15:53:01,517 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-25 15:53:01,518 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:53:01,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:53:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-25 15:53:01,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:53:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:53:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-02-25 15:53:01,522 INFO L87 Difference]: Start difference. First operand 17 states and 40 transitions. Second operand 4 states. [2019-02-25 15:53:03,787 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_566 Int) (v_idx_567 Int) (v_idx_564 Int) (v_idx_565 Int) (v_idx_562 Int) (v_idx_563 Int) (v_idx_560 Int) (v_idx_561 Int)) (let ((.cse72 (select |c_#memory_int| v_idx_560)) (.cse67 (+ v_idx_562 3)) (.cse66 (+ c_ULTIMATE.start_main_p1 3)) (.cse73 (+ c_ULTIMATE.start_main_p1 1)) (.cse74 (+ c_ULTIMATE.start_main_p1 2)) (.cse68 (+ v_idx_563 2))) (let ((.cse62 (<= (+ v_idx_563 1) v_idx_562)) (.cse61 (<= v_idx_563 v_idx_561)) (.cse63 (<= .cse68 v_idx_564)) (.cse54 (<= (+ v_idx_562 2) v_idx_563)) (.cse3 (<= .cse74 v_idx_563)) (.cse50 (= (select |c_#memory_int| v_idx_562) 0)) (.cse51 (<= .cse74 v_idx_562)) (.cse49 (<= .cse73 v_idx_561)) (.cse53 (<= (+ v_idx_562 1) v_idx_561)) (.cse48 (< v_idx_561 .cse73)) (.cse17 (<= .cse66 v_idx_564)) (.cse57 (<= .cse67 v_idx_564)) (.cse33 (<= .cse73 v_idx_560)) (.cse69 (<= 0 (* 2 .cse72))) (.cse70 (<= 0 .cse72)) (.cse34 (< v_idx_560 c_ULTIMATE.start_main_p1)) (.cse71 (select |c_#memory_int| v_idx_566))) (let ((.cse11 (<= (* 2 .cse71) 0)) (.cse12 (<= .cse71 0)) (.cse13 (or .cse33 (and .cse69 (<= .cse71 .cse72) .cse70) .cse34)) (.cse45 (<= (+ v_idx_564 1) v_idx_563)) (.cse31 (and .cse69 .cse70)) (.cse58 (or (and .cse17 .cse50 (or .cse17 (and .cse48 .cse17) (and .cse17 .cse49))) (and .cse51 (or (and .cse51 .cse17 .cse49) (and .cse51 .cse17) (and .cse48 .cse51 .cse17)) .cse17) (and .cse17 (or (and .cse17 .cse57) (and .cse17 .cse49 .cse53 .cse57) (and .cse48 .cse17 .cse57))))) (.cse55 (or (and .cse51 .cse3 (or (and .cse48 .cse51 .cse3) (and .cse51 .cse3) (and .cse51 .cse49 .cse3))) (and (or (and .cse3 .cse54) (and .cse48 .cse3 .cse54) (and .cse49 .cse3 .cse53 .cse54)) .cse3) (and (or (and .cse48 .cse3) .cse3 (and .cse49 .cse3)) .cse50 .cse3))) (.cse60 (<= (+ v_idx_563 3) v_idx_566)) (.cse4 (<= v_idx_565 v_idx_563)) (.cse64 (or (and (or (and .cse48 .cse17 .cse3 .cse57 .cse54) (and .cse17 .cse3 .cse57 .cse54) (and .cse17 .cse49 .cse3 .cse53 .cse57 .cse54)) .cse17 .cse3) (and .cse17 .cse50 .cse3 (or (and .cse17 .cse3) (and .cse48 .cse17 .cse3) (and .cse17 .cse49 .cse3))) (and (or (and .cse48 .cse51 .cse17 .cse3) (and .cse51 .cse17 .cse49 .cse3) (and .cse51 .cse17 .cse3)) .cse51 .cse17 .cse3))) (.cse59 (<= .cse68 v_idx_565)) (.cse65 (or (and .cse63 .cse51 .cse17 .cse62 (or (and .cse48 .cse63 .cse51 .cse17 .cse62) (and .cse63 .cse51 .cse61 .cse17 .cse49 .cse62) (and .cse63 .cse51 .cse17 .cse62))) (and .cse63 .cse17 .cse50 (or (and .cse48 .cse63 .cse17) (and .cse63 .cse17) (and .cse63 .cse61 .cse17 .cse49))) (and .cse63 .cse17 (or (and .cse48 .cse63 .cse17 .cse57) (and .cse63 .cse61 .cse17 .cse49 .cse53 .cse57) (and .cse63 .cse17 .cse57))))) (.cse18 (<= (+ v_idx_565 1) v_idx_564)) (.cse52 (<= .cse67 v_idx_565)) (.cse56 (<= (+ v_idx_562 4) v_idx_566)) (.cse1 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_566)) (.cse7 (<= .cse66 v_idx_565))) (let ((.cse19 (or (and .cse51 (or (and .cse48 .cse51 .cse1 .cse17 .cse7) (and .cse51 .cse1 .cse17 .cse49 .cse7) (and .cse51 .cse1 .cse17 .cse7)) .cse1 .cse17 .cse7) (and .cse1 .cse17 (or (and .cse52 .cse56 .cse1 .cse17 .cse49 .cse53 .cse57 .cse7) (and .cse48 .cse52 .cse56 .cse1 .cse17 .cse57 .cse7) (and .cse52 .cse56 .cse1 .cse17 .cse57 .cse7)) .cse7) (and (or (and .cse1 .cse17 .cse49 .cse7) (and .cse1 .cse17 .cse7) (and .cse48 .cse1 .cse17 .cse7)) .cse1 .cse17 .cse50 .cse7))) (.cse16 (or (and (or (and .cse48 .cse56 .cse1 .cse17 .cse57) (and .cse56 .cse1 .cse17 .cse49 .cse53 .cse57) (and .cse56 .cse1 .cse17 .cse57)) .cse1 .cse17) (and .cse51 .cse1 (or (and .cse48 .cse51 .cse1 .cse17) (and .cse51 .cse1 .cse17) (and .cse51 .cse1 .cse17 .cse49)) .cse17) (and .cse1 (or (and .cse1 .cse17 .cse49) (and .cse1 .cse17) (and .cse48 .cse1 .cse17)) .cse17 .cse50))) (.cse41 (and .cse65 .cse17 .cse18)) (.cse42 (and .cse65 .cse17)) (.cse40 (or (and (or (and .cse52 .cse63 .cse61 .cse17 .cse49 .cse53 .cse57 .cse59 .cse7) (and .cse48 .cse52 .cse63 .cse17 .cse57 .cse59 .cse7) (and .cse52 .cse63 .cse17 .cse57 .cse59 .cse7)) .cse63 .cse17 .cse59 .cse7) (and .cse63 .cse17 .cse50 .cse59 .cse7 (or (and .cse48 .cse63 .cse17 .cse59 .cse7) (and .cse63 .cse61 .cse17 .cse49 .cse59 .cse7) (and .cse63 .cse17 .cse59 .cse7))) (and .cse63 .cse51 .cse17 (or (and .cse63 .cse51 .cse17 .cse59 .cse62 .cse7) (and .cse63 .cse51 .cse61 .cse17 .cse49 .cse59 .cse62 .cse7) (and .cse48 .cse63 .cse51 .cse17 .cse59 .cse62 .cse7)) .cse59 .cse62 .cse7))) (.cse23 (and .cse17 .cse3 .cse64)) (.cse22 (or (and (or (and .cse52 .cse17 .cse3 .cse57 .cse54 .cse7) (and .cse48 .cse52 .cse17 .cse3 .cse57 .cse54 .cse7) (and .cse52 .cse17 .cse49 .cse3 .cse53 .cse57 .cse54 .cse7)) .cse17 .cse3 .cse7) (and (or (and .cse48 .cse17 .cse3 .cse7) (and .cse17 .cse3 .cse7) (and .cse17 .cse49 .cse3 .cse7)) .cse17 .cse50 .cse3 .cse7) (and .cse51 .cse17 (or (and .cse51 .cse17 .cse3 .cse7) (and .cse51 .cse17 .cse49 .cse3 .cse7) (and .cse48 .cse51 .cse17 .cse3 .cse7)) .cse3 .cse7))) (.cse24 (and .cse17 .cse3 .cse4 .cse64 .cse18)) (.cse26 (or (and .cse51 .cse1 .cse17 .cse3 .cse7 (or (and .cse48 .cse51 .cse1 .cse17 .cse3 .cse7) (and .cse51 .cse1 .cse17 .cse49 .cse3 .cse7) (and .cse51 .cse1 .cse17 .cse3 .cse7))) (and (or (and .cse1 .cse17 .cse3 .cse7) (and .cse1 .cse17 .cse49 .cse3 .cse7) (and .cse48 .cse1 .cse17 .cse3 .cse7)) .cse1 .cse17 .cse50 .cse3 .cse7) (and (or (and .cse52 .cse56 .cse1 .cse17 .cse49 .cse3 .cse53 .cse57 .cse54 .cse7) (and .cse52 .cse56 .cse1 .cse17 .cse3 .cse57 .cse54 .cse7) (and .cse48 .cse52 .cse56 .cse1 .cse17 .cse3 .cse57 .cse54 .cse7)) .cse1 .cse17 .cse3 .cse7))) (.cse25 (or (and .cse1 .cse17 .cse3 (or (and .cse56 .cse1 .cse17 .cse49 .cse3 .cse53 .cse57 .cse54) (and .cse56 .cse1 .cse17 .cse3 .cse57 .cse54) (and .cse48 .cse56 .cse1 .cse17 .cse3 .cse57 .cse54))) (and .cse51 .cse1 .cse17 .cse3 (or (and .cse51 .cse1 .cse17 .cse3) (and .cse51 .cse1 .cse17 .cse49 .cse3) (and .cse48 .cse51 .cse1 .cse17 .cse3))) (and .cse1 .cse17 .cse50 .cse3 (or (and .cse1 .cse17 .cse49 .cse3) (and .cse48 .cse1 .cse17 .cse3) (and .cse1 .cse17 .cse3))))) (.cse43 (or (and .cse63 (or (and .cse52 .cse63 .cse56 .cse61 .cse1 .cse17 .cse49 .cse53 .cse57 .cse59 .cse60 .cse7) (and .cse52 .cse63 .cse56 .cse1 .cse17 .cse57 .cse59 .cse60 .cse7) (and .cse48 .cse52 .cse63 .cse56 .cse1 .cse17 .cse57 .cse59 .cse60 .cse7)) .cse1 .cse17 .cse59 .cse60 .cse7) (and .cse63 (or (and .cse63 .cse61 .cse1 .cse17 .cse49 .cse59 .cse60 .cse7) (and .cse48 .cse63 .cse1 .cse17 .cse59 .cse60 .cse7) (and .cse63 .cse1 .cse17 .cse59 .cse60 .cse7)) .cse1 .cse17 .cse50 .cse59 .cse60 .cse7) (and .cse63 .cse51 .cse1 .cse17 .cse59 .cse62 .cse60 (or (and .cse63 .cse51 .cse1 .cse17 .cse59 .cse62 .cse60 .cse7) (and .cse48 .cse63 .cse51 .cse1 .cse17 .cse59 .cse62 .cse60 .cse7) (and .cse63 .cse51 .cse61 .cse1 .cse17 .cse49 .cse59 .cse62 .cse60 .cse7)) .cse7))) (.cse44 (or (and .cse63 .cse1 .cse17 .cse50 (or (and .cse48 .cse63 .cse1 .cse17 .cse60) (and .cse63 .cse1 .cse17 .cse60) (and .cse63 .cse61 .cse1 .cse17 .cse49 .cse60)) .cse60) (and .cse63 .cse1 .cse17 (or (and .cse48 .cse63 .cse56 .cse1 .cse17 .cse57 .cse60) (and .cse63 .cse56 .cse61 .cse1 .cse17 .cse49 .cse53 .cse57 .cse60) (and .cse63 .cse56 .cse1 .cse17 .cse57 .cse60)) .cse60) (and .cse63 .cse51 .cse1 .cse17 (or (and .cse63 .cse51 .cse61 .cse1 .cse17 .cse49 .cse62 .cse60) (and .cse63 .cse51 .cse1 .cse17 .cse62 .cse60) (and .cse48 .cse63 .cse51 .cse1 .cse17 .cse62 .cse60)) .cse62 .cse60))) (.cse21 (<= (+ v_idx_567 1) v_idx_566)) (.cse8 (and .cse55 .cse3 .cse4)) (.cse10 (and .cse55 .cse3)) (.cse35 (or (and .cse1 (or (and .cse48 .cse56 .cse1) (and .cse56 .cse1 .cse49 .cse53) (and .cse56 .cse1))) (and .cse51 .cse1 (or (and .cse48 .cse51 .cse1) (and .cse51 .cse1 .cse49) (and .cse51 .cse1))) (and (or (and .cse48 .cse1) .cse1 (and .cse1 .cse49)) .cse1 .cse50))) (.cse36 (or (and .cse1 (or (and .cse52 .cse56 .cse1 .cse7) (and .cse52 .cse56 .cse1 .cse49 .cse53 .cse7) (and .cse48 .cse52 .cse56 .cse1 .cse7)) .cse7) (and .cse51 .cse1 (or (and .cse51 .cse1 .cse7) (and .cse51 .cse1 .cse49 .cse7) (and .cse48 .cse51 .cse1 .cse7)) .cse7) (and (or (and .cse1 .cse49 .cse7) (and .cse48 .cse1 .cse7) (and .cse1 .cse7)) .cse1 .cse50 .cse7))) (.cse15 (= (select |c_#memory_int| v_idx_564) 0)) (.cse30 (or (and .cse1 .cse50 (or (and .cse48 .cse1 .cse60) (and .cse1 .cse60) (and .cse61 .cse1 .cse49 .cse60)) .cse60) (and .cse1 (or (and .cse48 .cse56 .cse1 .cse60) (and .cse56 .cse1 .cse60) (and .cse56 .cse61 .cse1 .cse49 .cse53 .cse60)) .cse60) (and .cse51 (or (and .cse51 .cse61 .cse1 .cse49 .cse62 .cse60) (and .cse51 .cse1 .cse62 .cse60) (and .cse48 .cse51 .cse1 .cse62 .cse60)) .cse1 .cse62 .cse60))) (.cse28 (or (and (or (and .cse52 .cse56 .cse1 .cse59 .cse60 .cse7) (and .cse52 .cse56 .cse61 .cse1 .cse49 .cse53 .cse59 .cse60 .cse7) (and .cse48 .cse52 .cse56 .cse1 .cse59 .cse60 .cse7)) .cse1 .cse59 .cse60 .cse7) (and .cse1 .cse50 (or (and .cse61 .cse1 .cse49 .cse59 .cse60 .cse7) (and .cse48 .cse1 .cse59 .cse60 .cse7) (and .cse1 .cse59 .cse60 .cse7)) .cse59 .cse60 .cse7) (and .cse51 (or (and .cse51 .cse61 .cse1 .cse49 .cse59 .cse62 .cse60 .cse7) (and .cse48 .cse51 .cse1 .cse59 .cse62 .cse60 .cse7) (and .cse51 .cse1 .cse59 .cse62 .cse60 .cse7)) .cse1 .cse59 .cse62 .cse60 .cse7))) (.cse38 (and .cse17 .cse58 .cse18)) (.cse39 (and .cse17 .cse58)) (.cse20 (<= v_idx_567 v_idx_565)) (.cse37 (or (and (or (and .cse48 .cse17 .cse7) (and .cse17 .cse49 .cse7) (and .cse17 .cse7)) .cse17 .cse50 .cse7) (and (or (and .cse48 .cse52 .cse17 .cse57 .cse7) (and .cse52 .cse17 .cse57 .cse7) (and .cse52 .cse17 .cse49 .cse53 .cse57 .cse7)) .cse17 .cse7) (and .cse51 .cse17 (or (and .cse48 .cse51 .cse17 .cse7) (and .cse51 .cse17 .cse7) (and .cse51 .cse17 .cse49 .cse7)) .cse7))) (.cse6 (or (and .cse1 .cse3 (or (and .cse52 .cse56 .cse1 .cse49 .cse3 .cse53 .cse54 .cse7) (and .cse52 .cse56 .cse1 .cse3 .cse54 .cse7) (and .cse48 .cse52 .cse56 .cse1 .cse3 .cse54 .cse7)) .cse7) (and .cse51 .cse1 .cse3 (or (and .cse51 .cse1 .cse49 .cse3 .cse7) (and .cse51 .cse1 .cse3 .cse7) (and .cse48 .cse51 .cse1 .cse3 .cse7)) .cse7) (and .cse1 (or (and .cse48 .cse1 .cse3 .cse7) (and .cse1 .cse49 .cse3 .cse7) (and .cse1 .cse3 .cse7)) .cse50 .cse3 .cse7))) (.cse5 (<= (+ v_idx_565 2) v_idx_566)) (.cse2 (or (and (or (and .cse1 .cse3) (and .cse1 .cse49 .cse3) (and .cse48 .cse1 .cse3)) .cse1 .cse50 .cse3) (and .cse51 .cse1 (or (and .cse51 .cse1 .cse49 .cse3) (and .cse51 .cse1 .cse3) (and .cse48 .cse51 .cse1 .cse3)) .cse3) (and .cse1 (or (and .cse56 .cse1 .cse3 .cse54) (and .cse56 .cse1 .cse49 .cse3 .cse53 .cse54) (and .cse48 .cse56 .cse1 .cse3 .cse54)) .cse3))) (.cse29 (<= (+ v_idx_564 3) v_idx_566)) (.cse0 (or .cse31 .cse33 .cse34)) (.cse46 (and .cse45 .cse55 .cse3)) (.cse47 (and .cse45 .cse55 .cse3 .cse4)) (.cse27 (<= (+ v_idx_564 2) v_idx_565)) (.cse14 (<= (+ v_idx_566 1) v_idx_565)) (.cse9 (or (and (or (and .cse3 .cse7) (and .cse48 .cse3 .cse7) (and .cse49 .cse3 .cse7)) .cse50 .cse3 .cse7) (and .cse51 .cse3 (or (and .cse51 .cse3 .cse7) (and .cse51 .cse49 .cse3 .cse7) (and .cse48 .cse51 .cse3 .cse7)) .cse7) (and .cse3 (or (and .cse52 .cse49 .cse3 .cse53 .cse54 .cse7) (and .cse52 .cse3 .cse54 .cse7) (and .cse48 .cse52 .cse3 .cse54 .cse7)) .cse7))) (.cse32 (and .cse11 .cse12 .cse13))) (or (and (or (and .cse0 .cse1 (or (and .cse2 .cse1 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse3 .cse7) (and .cse2 .cse1 .cse3))) (and (or .cse8 (and .cse3 .cse9 .cse7) .cse10) .cse11 .cse12 .cse13) (and (or (and .cse14 .cse3 .cse9 .cse7) .cse8 .cse10) .cse0)) .cse15 .cse3) (and .cse0 .cse1 (or (and .cse16 .cse1 .cse17 .cse5 .cse18) (and .cse16 .cse1 .cse17) (and .cse1 .cse17 .cse19 .cse7))) (and (or (and .cse1 .cse20 .cse17 .cse21 .cse19 .cse7) (and .cse16 .cse1 .cse17 .cse21 .cse5 .cse18) (and .cse16 .cse1 .cse17 .cse21)) .cse0 .cse1 .cse21) (and (or (and .cse0 (or (and .cse14 .cse17 .cse22 .cse3 .cse7) .cse23 .cse24)) (and .cse0 .cse1 (or (and .cse1 .cse17 .cse3 .cse4 .cse25 .cse5 .cse18) (and .cse1 .cse17 .cse3 .cse25) (and .cse1 .cse17 .cse26 .cse3 .cse7))) (and .cse11 .cse12 .cse13 (or .cse23 (and .cse17 .cse22 .cse3 .cse7) .cse24))) .cse3) (and .cse0 .cse1 .cse21 (or (and .cse27 .cse28 .cse1 .cse20 .cse21 .cse29 .cse7) (and .cse1 .cse21 .cse30 .cse29) (and .cse1 .cse21 .cse30 .cse29 .cse5)) .cse29) (and .cse15 (or (and .cse0 .cse1 .cse21 (or (and .cse1 .cse21 .cse30) (and .cse1 .cse21 .cse30 .cse5) (and .cse28 .cse1 .cse20 .cse21 .cse7))) .cse31 .cse32 .cse33 .cse34)) (and .cse0 .cse1 .cse21 (or (and .cse1 .cse21 .cse35 .cse29) (and .cse27 .cse1 .cse20 .cse21 .cse29 .cse7 .cse36) (and .cse1 .cse21 .cse35 .cse29 .cse5)) .cse29) (and (or (and .cse14 .cse37 .cse17 .cse7) .cse38 .cse39) .cse0) (and .cse11 .cse12 .cse13 (or (and .cse40 .cse17 .cse7) .cse41 .cse42)) (and .cse0 (or (and .cse14 .cse40 .cse17 .cse7) .cse41 .cse42)) (and .cse11 .cse12 .cse13 (or .cse41 .cse42 (and .cse40 .cse20 .cse17 .cse7))) (and (or (and .cse0 .cse1 (or (and .cse1 .cse21 .cse35) (and .cse1 .cse20 .cse21 .cse7 .cse36) (and .cse1 .cse21 .cse35 .cse5)) .cse21) .cse31 .cse32 .cse33 .cse34) .cse15) .cse33 .cse34 (and .cse0 .cse1 (or (and .cse1 .cse35 .cse29 .cse5) (and .cse1 .cse35 .cse29) (and .cse27 .cse1 .cse29 .cse7 .cse36)) .cse29) (and (or .cse41 .cse42 (and .cse14 .cse40 .cse20 .cse17 .cse7)) .cse0) (and (or (and .cse11 .cse12 .cse13 (or .cse23 .cse24 (and .cse20 .cse17 .cse22 .cse3 .cse7))) (and (or .cse23 (and .cse14 .cse20 .cse17 .cse22 .cse3 .cse7) .cse24) .cse0) (and (or (and .cse1 .cse20 .cse17 .cse21 .cse26 .cse3 .cse7) (and .cse1 .cse17 .cse21 .cse3 .cse25) (and .cse1 .cse17 .cse21 .cse3 .cse4 .cse25 .cse5 .cse18)) .cse0 .cse1 .cse21)) .cse3) (and .cse11 (or .cse38 .cse39 (and .cse37 .cse17 .cse7)) .cse12 .cse13) (and .cse0 .cse1 (or (and .cse1 .cse17 .cse43 .cse7) (and .cse1 .cse17 .cse44 .cse5 .cse18) (and .cse1 .cse17 .cse44))) (and .cse0 .cse1 .cse21 (or (and .cse1 .cse20 .cse17 .cse21 .cse43 .cse7) (and .cse1 .cse17 .cse21 .cse44) (and .cse1 .cse17 .cse21 .cse44 .cse5 .cse18))) (and .cse0 (or .cse38 .cse39 (and .cse14 .cse20 .cse37 .cse17 .cse7))) (and .cse45 .cse3 (or (and .cse11 .cse12 .cse13 (or (and .cse27 .cse45 .cse20 .cse3 .cse9 .cse7) .cse46 .cse47)) (and .cse0 (or (and .cse27 .cse45 .cse14 .cse20 .cse3 .cse9 .cse7) .cse46 .cse47)) (and .cse0 .cse1 .cse21 (or (and .cse27 .cse45 .cse1 .cse20 .cse21 .cse6 .cse3 .cse29 .cse7) (and .cse45 .cse2 .cse1 .cse21 .cse3 .cse4 .cse29 .cse5) (and .cse45 .cse2 .cse1 .cse21 .cse3 .cse29)) .cse29))) (and (or (and .cse11 .cse12 .cse13 (or .cse8 (and .cse20 .cse3 .cse9 .cse7) .cse10)) (and .cse0 .cse1 .cse21 (or (and .cse2 .cse1 .cse21 .cse3) (and .cse2 .cse1 .cse21 .cse3 .cse4 .cse5) (and .cse1 .cse20 .cse21 .cse6 .cse3 .cse7))) (and .cse0 (or (and .cse14 .cse20 .cse3 .cse9 .cse7) .cse8 .cse10))) .cse15 .cse3) (and (or (and .cse0 .cse1 (or (and .cse1 .cse30 .cse5) (and .cse28 .cse1 .cse7) (and .cse1 .cse30))) .cse31 .cse32 .cse33 .cse34) .cse15) (and (or (and (or (and .cse1 .cse35 .cse5) (and .cse1 .cse35) (and .cse1 .cse7 .cse36)) .cse0 .cse1) .cse31 .cse32 .cse33 .cse34) .cse15) (and .cse0 .cse1 (or (and .cse1 .cse30 .cse29) (and .cse1 .cse30 .cse29 .cse5) (and .cse27 .cse28 .cse1 .cse29 .cse7)) .cse29) (and .cse11 .cse12 .cse13 (or .cse38 .cse39 (and .cse20 .cse37 .cse17 .cse7))) (and .cse45 (or (and .cse11 .cse12 (or .cse46 .cse47 (and .cse27 .cse45 .cse3 .cse9 .cse7)) .cse13) (and .cse0 .cse1 (or (and .cse27 .cse45 .cse1 .cse6 .cse3 .cse29 .cse7) (and .cse45 .cse2 .cse1 .cse3 .cse4 .cse29 .cse5) (and .cse45 .cse2 .cse1 .cse3 .cse29)) .cse29) (and .cse0 (or .cse46 .cse47 (and .cse27 .cse45 .cse14 .cse3 .cse9 .cse7)))) .cse3) .cse31 .cse32)))))) (forall ((v_idx_555 Int) (v_idx_556 Int) (v_idx_553 Int) (v_idx_554 Int) (v_idx_557 Int) (v_idx_551 Int) (v_idx_552 Int)) (let ((.cse126 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse112 (+ c_ULTIMATE.start_main_p1 1)) (.cse77 (<= .cse126 c_ULTIMATE.start_main_p4))) (and (let ((.cse125 (+ c_ULTIMATE.start_main_p1 2)) (.cse127 (+ v_idx_554 2)) (.cse128 (+ v_idx_553 3))) (let ((.cse124 (+ v_idx_556 1)) (.cse116 (<= .cse128 v_idx_555)) (.cse99 (<= .cse128 c_ULTIMATE.start_main_p4)) (.cse119 (<= (+ v_idx_553 2) v_idx_554)) (.cse123 (<= .cse127 v_idx_555)) (.cse84 (<= .cse127 c_ULTIMATE.start_main_p4)) (.cse114 (<= .cse126 v_idx_555)) (.cse122 (<= (+ v_idx_555 1) v_idx_554)) (.cse117 (<= (+ v_idx_555 2) c_ULTIMATE.start_main_p4)) (.cse118 (= (select |c_#memory_int| v_idx_555) 0)) (.cse121 (<= .cse125 v_idx_554))) (let ((.cse92 (or (and .cse114 .cse121 .cse77) (and .cse121 .cse77 .cse122 .cse117) (and .cse118 .cse121 .cse77))) (.cse91 (or (and .cse77 .cse117) (and .cse114 .cse77) (and .cse118 .cse77))) (.cse104 (<= (+ v_idx_554 1) v_idx_553)) (.cse105 (<= .cse125 v_idx_553)) (.cse93 (or (and .cse77 .cse117 .cse84) (and .cse123 .cse114 .cse77 .cse84) (and .cse118 .cse77 .cse84))) (.cse110 (or (and .cse99 .cse114 .cse116 .cse119 .cse121 .cse77) (and .cse99 .cse118 .cse119 .cse121 .cse77) (and .cse99 .cse119 .cse121 .cse77 .cse122 .cse117))) (.cse109 (or (and .cse99 .cse123 .cse114 .cse116 .cse77 .cse84) (and .cse99 .cse77 .cse117 .cse84) (and .cse99 .cse118 .cse77 .cse84))) (.cse108 (or (and .cse99 .cse114 .cse116 .cse77) (and .cse99 .cse118 .cse77) (and .cse99 .cse77 .cse117))) (.cse113 (<= .cse124 v_idx_555)) (.cse115 (<= .cse124 c_ULTIMATE.start_main_p4)) (.cse120 (<= v_idx_556 v_idx_554))) (let ((.cse86 (or (and .cse113 .cse114 .cse115 .cse120 .cse121 .cse77) (and .cse118 .cse115 .cse120 .cse121 .cse77) (and .cse115 .cse120 .cse121 .cse77 .cse122 .cse117))) (.cse85 (or (and .cse118 .cse115 .cse77) (and .cse115 .cse77 .cse117) (and .cse113 .cse114 .cse115 .cse77))) (.cse82 (or (and .cse115 .cse77 .cse117 .cse84) (and .cse123 .cse113 .cse114 .cse115 .cse77 .cse84) (and .cse118 .cse115 .cse77 .cse84))) (.cse100 (<= (+ v_idx_553 1) v_idx_552)) (.cse107 (or (and .cse110 .cse99 .cse77) (and .cse99 .cse77 .cse109 .cse84) (and .cse99 .cse108 .cse77))) (.cse87 (< v_idx_552 .cse112)) (.cse102 (or (and .cse99 .cse123 .cse113 .cse114 .cse115 .cse116 .cse77 .cse84) (and .cse99 .cse115 .cse77 .cse117 .cse84) (and .cse99 .cse118 .cse115 .cse77 .cse84))) (.cse101 (or (and .cse99 .cse118 .cse115 .cse119 .cse120 .cse121 .cse77) (and .cse99 .cse115 .cse119 .cse120 .cse121 .cse77 .cse122 .cse117) (and .cse99 .cse113 .cse114 .cse115 .cse116 .cse119 .cse120 .cse121 .cse77))) (.cse103 (or (and .cse99 .cse113 .cse114 .cse115 .cse116 .cse77) (and .cse99 .cse115 .cse77 .cse117) (and .cse99 .cse118 .cse115 .cse77))) (.cse83 (<= v_idx_554 v_idx_552)) (.cse81 (<= .cse112 v_idx_552)) (.cse111 (or (and .cse105 .cse92 .cse77) (and .cse105 .cse91 .cse77) (and .cse104 .cse105 .cse77 .cse84 .cse93)))) (let ((.cse75 (and .cse111 .cse77)) (.cse96 (and (or (and .cse105 .cse92 .cse81 .cse77) (and .cse105 .cse91 .cse81 .cse77) (and .cse104 .cse105 .cse81 .cse77 .cse83 .cse84 .cse93)) .cse81 .cse77)) (.cse98 (or (and .cse99 .cse102 .cse77 .cse84) (and .cse99 .cse101 .cse77) (and .cse99 .cse103 .cse77))) (.cse95 (and .cse111 .cse87 .cse77)) (.cse106 (and .cse99 .cse87 .cse107 .cse77)) (.cse94 (and .cse99 .cse100 (or (and .cse99 .cse100 .cse108 .cse81 .cse77) (and .cse99 .cse100 .cse81 .cse77 .cse83 .cse109 .cse84) (and .cse110 .cse99 .cse100 .cse81 .cse77)) .cse81 .cse77)) (.cse97 (and .cse99 .cse107 .cse77)) (.cse89 (<= c_ULTIMATE.start_main_p4 v_idx_556)) (.cse76 (or (and .cse105 .cse86 .cse77) (and .cse85 .cse105 .cse77) (and .cse104 .cse105 .cse82 .cse77 .cse84)))) (or .cse75 (and .cse76 .cse77) (and (let ((.cse90 (or (and .cse77 .cse84 .cse93) (and .cse91 .cse77) (and .cse92 .cse77)))) (let ((.cse78 (or (and .cse85 .cse77) (and .cse82 .cse77 .cse84) (and .cse86 .cse77))) (.cse79 (and .cse90 .cse77)) (.cse80 (and (or (and .cse91 .cse81 .cse77) (and .cse92 .cse81 .cse77) (and .cse81 .cse77 .cse83 .cse84 .cse93)) .cse81 .cse77)) (.cse88 (and .cse87 .cse90 .cse77))) (or (and .cse78 .cse77) .cse79 .cse80 (and (or (and .cse81 .cse82 .cse77 .cse83 .cse84) (and .cse85 .cse81 .cse77) (and .cse86 .cse81 .cse77)) .cse81 .cse77) (and .cse78 .cse87 .cse77) (and (or .cse79 .cse80 .cse88) .cse89) .cse88))) (= (select |c_#memory_int| v_idx_553) 0)) .cse94 (and (or .cse75 .cse95 .cse96) .cse89) .cse97 (and .cse98 .cse99 .cse77) .cse96 (and .cse99 .cse100 (or (and .cse99 .cse100 .cse101 .cse81 .cse77) (and .cse99 .cse100 .cse102 .cse81 .cse77 .cse83 .cse84) (and .cse99 .cse100 .cse81 .cse103 .cse77)) .cse81 .cse77) (and .cse98 .cse99 .cse87 .cse77) (and .cse81 (or (and .cse104 .cse105 .cse81 .cse82 .cse77 .cse83 .cse84) (and .cse85 .cse105 .cse81 .cse77) (and .cse105 .cse86 .cse81 .cse77)) .cse77) .cse106 .cse95 (and (or .cse106 .cse94 .cse97) .cse89) (and .cse87 .cse76 .cse77))))))) (let ((.cse133 (select |c_#memory_int| v_idx_557))) (let ((.cse132 (<= (* 2 .cse133) 0)) (.cse135 (<= .cse133 0)) (.cse130 (< v_idx_557 c_ULTIMATE.start_main_p4)) (.cse131 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_557))) (let ((.cse129 (or (and .cse132 .cse135) .cse130 .cse131))) (or (and .cse129 (< v_idx_551 c_ULTIMATE.start_main_p1)) (and (<= .cse112 v_idx_551) .cse129) (let ((.cse134 (select |c_#memory_int| v_idx_551))) (and (or .cse130 .cse131 (and .cse132 (<= .cse133 .cse134) .cse135)) (<= 0 (* 2 .cse134)) (<= 0 .cse134))))))) .cse77))))) is different from false [2019-02-25 15:53:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:15,721 INFO L93 Difference]: Finished difference Result 23 states and 53 transitions. [2019-02-25 15:53:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:53:15,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:53:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:15,722 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:53:15,722 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:53:15,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-02-25 15:53:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:53:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-02-25 15:53:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:53:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 40 transitions. [2019-02-25 15:53:15,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 40 transitions. Word has length 4 [2019-02-25 15:53:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:15,752 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 40 transitions. [2019-02-25 15:53:15,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:53:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 40 transitions. [2019-02-25 15:53:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:15,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:15,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:15,753 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-25 15:53:15,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:15,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:15,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:15,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:15,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:15,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:15,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:15,862 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-25 15:53:15,864 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:15,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:26,994 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:53:26,994 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:26,995 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:53:27,974 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-02-25 15:53:27,975 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:53:30,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_698 Int) (v_idx_699 Int) (v_idx_697 Int) (v_idx_700 Int) (v_idx_701 Int) (v_idx_695 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (<= .cse17 c_ULTIMATE.start_main_p4)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (<= .cse18 c_ULTIMATE.start_main_p4))) (and (let ((.cse14 (+ v_idx_700 1)) (.cse8 (<= (+ v_idx_699 1) v_idx_698)) (.cse1 (<= (+ v_idx_699 2) c_ULTIMATE.start_main_p4)) (.cse6 (<= .cse19 v_idx_698)) (.cse7 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_698)) (.cse4 (< v_idx_698 .cse19)) (.cse9 (<= .cse18 v_idx_699)) (.cse12 (<= .cse17 v_idx_699))) (let ((.cse11 (or (and .cse6 .cse7 .cse9 .cse12 .cse2 .cse3) (and .cse9 .cse4 .cse12 .cse2 .cse3) (and .cse9 .cse12 .cse2 .cse3))) (.cse15 (or (and .cse6 .cse7 .cse8 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (.cse10 (<= c_ULTIMATE.start_main_p4 v_idx_700)) (.cse5 (<= v_idx_700 v_idx_698)) (.cse0 (<= .cse14 c_ULTIMATE.start_main_p4))) (or (and .cse0 (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 .cse2 .cse3)) .cse2 .cse3) (and .cse9 .cse10 .cse11 .cse12 .cse2 .cse3) (let ((.cse13 (<= .cse14 v_idx_699))) (and .cse9 .cse0 (or (and .cse5 .cse6 .cse7 .cse9 .cse0 .cse12 .cse2 .cse13 .cse3) (and .cse9 .cse0 .cse12 .cse2 .cse13 .cse3) (and .cse9 .cse4 .cse0 .cse12 .cse2 .cse13 .cse3)) .cse12 .cse2 .cse13 .cse3)) (and .cse9 .cse11 .cse12 .cse2 .cse3) (and .cse15 .cse2 .cse3) (and .cse15 .cse10 .cse2 .cse3) (and (let ((.cse16 (or (and .cse6 .cse7 .cse2 .cse3) (and .cse2 .cse3) (and .cse4 .cse2 .cse3)))) (or (and .cse10 .cse16 .cse2 .cse3) (and .cse16 .cse2 .cse3) (and (or (and .cse4 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse7 .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse3)) .cse0 .cse2 .cse3))) (= (select |c_#memory_int| v_idx_699) 0))))) (<= .cse20 c_ULTIMATE.start_main_p2) (let ((.cse27 (select |c_#memory_int| v_idx_701))) (let ((.cse23 (< v_idx_701 c_ULTIMATE.start_main_p4)) (.cse24 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_701)) (.cse25 (<= .cse27 0)) (.cse26 (<= (* 2 .cse27) 0))) (let ((.cse21 (or .cse23 .cse24 (and .cse25 .cse26)))) (or (and .cse21 (< v_idx_697 c_ULTIMATE.start_main_p2)) (and (<= .cse19 v_idx_697) .cse21) (let ((.cse22 (select |c_#memory_int| v_idx_697))) (and (<= .cse22 0) (<= (* 2 .cse22) 0) (or .cse23 .cse24 (and .cse25 .cse26 (<= (+ .cse22 .cse27) 0))))))))) .cse2 (or (< v_idx_695 c_ULTIMATE.start_main_p1) (<= .cse20 v_idx_695) (= (select |c_#memory_int| v_idx_695) 0)) .cse3)))) is different from false [2019-02-25 15:53:31,931 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-25 15:53:31,931 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:53:31,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:53:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-25 15:53:31,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:31,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:53:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:53:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=7, Unknown=1, NotChecked=4, Total=20 [2019-02-25 15:53:31,933 INFO L87 Difference]: Start difference. First operand 17 states and 40 transitions. Second operand 5 states. [2019-02-25 15:53:34,076 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_698 Int) (v_idx_699 Int) (v_idx_697 Int) (v_idx_700 Int) (v_idx_701 Int) (v_idx_695 Int)) (let ((.cse18 (+ c_ULTIMATE.start_main_p2 2)) (.cse17 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (<= .cse17 c_ULTIMATE.start_main_p4)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (<= .cse18 c_ULTIMATE.start_main_p4))) (and (let ((.cse14 (+ v_idx_700 1)) (.cse8 (<= (+ v_idx_699 1) v_idx_698)) (.cse1 (<= (+ v_idx_699 2) c_ULTIMATE.start_main_p4)) (.cse6 (<= .cse19 v_idx_698)) (.cse7 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_698)) (.cse4 (< v_idx_698 .cse19)) (.cse9 (<= .cse18 v_idx_699)) (.cse12 (<= .cse17 v_idx_699))) (let ((.cse11 (or (and .cse6 .cse7 .cse9 .cse12 .cse2 .cse3) (and .cse9 .cse4 .cse12 .cse2 .cse3) (and .cse9 .cse12 .cse2 .cse3))) (.cse15 (or (and .cse6 .cse7 .cse8 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (.cse10 (<= c_ULTIMATE.start_main_p4 v_idx_700)) (.cse5 (<= v_idx_700 v_idx_698)) (.cse0 (<= .cse14 c_ULTIMATE.start_main_p4))) (or (and .cse0 (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse7 .cse8 .cse0 .cse1 .cse2 .cse3)) .cse2 .cse3) (and .cse9 .cse10 .cse11 .cse12 .cse2 .cse3) (let ((.cse13 (<= .cse14 v_idx_699))) (and .cse9 .cse0 (or (and .cse5 .cse6 .cse7 .cse9 .cse0 .cse12 .cse2 .cse13 .cse3) (and .cse9 .cse0 .cse12 .cse2 .cse13 .cse3) (and .cse9 .cse4 .cse0 .cse12 .cse2 .cse13 .cse3)) .cse12 .cse2 .cse13 .cse3)) (and .cse9 .cse11 .cse12 .cse2 .cse3) (and .cse15 .cse2 .cse3) (and .cse15 .cse10 .cse2 .cse3) (and (let ((.cse16 (or (and .cse6 .cse7 .cse2 .cse3) (and .cse2 .cse3) (and .cse4 .cse2 .cse3)))) (or (and .cse10 .cse16 .cse2 .cse3) (and .cse16 .cse2 .cse3) (and (or (and .cse4 .cse0 .cse2 .cse3) (and .cse5 .cse6 .cse7 .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse3)) .cse0 .cse2 .cse3))) (= (select |c_#memory_int| v_idx_699) 0))))) (<= .cse20 c_ULTIMATE.start_main_p2) (let ((.cse27 (select |c_#memory_int| v_idx_701))) (let ((.cse23 (< v_idx_701 c_ULTIMATE.start_main_p4)) (.cse24 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_701)) (.cse25 (<= .cse27 0)) (.cse26 (<= (* 2 .cse27) 0))) (let ((.cse21 (or .cse23 .cse24 (and .cse25 .cse26)))) (or (and .cse21 (< v_idx_697 c_ULTIMATE.start_main_p2)) (and (<= .cse19 v_idx_697) .cse21) (let ((.cse22 (select |c_#memory_int| v_idx_697))) (and (<= .cse22 0) (<= (* 2 .cse22) 0) (or .cse23 .cse24 (and .cse25 .cse26 (<= (+ .cse22 .cse27) 0))))))))) .cse2 (or (< v_idx_695 c_ULTIMATE.start_main_p1) (<= .cse20 v_idx_695) (= (select |c_#memory_int| v_idx_695) 0)) .cse3)))) (forall ((v_idx_710 Int) (v_idx_711 Int) (v_idx_706 Int) (v_idx_707 Int) (v_idx_704 Int) (v_idx_708 Int) (v_idx_709 Int)) (let ((.cse78 (+ c_ULTIMATE.start_main_p1 1))) (and (let ((.cse74 (select |c_#memory_int| v_idx_706))) (let ((.cse77 (+ c_ULTIMATE.start_main_p1 3)) (.cse76 (+ c_ULTIMATE.start_main_p2 2)) (.cse73 (<= (* 2 .cse74) 0)) (.cse75 (<= .cse74 0)) (.cse61 (+ c_ULTIMATE.start_main_p2 1))) (let ((.cse72 (select |c_#memory_int| v_idx_710)) (.cse28 (<= .cse61 v_idx_706)) (.cse52 (< v_idx_706 c_ULTIMATE.start_main_p2)) (.cse56 (and .cse73 .cse75)) (.cse31 (<= (+ c_ULTIMATE.start_main_p2 3) v_idx_710)) (.cse32 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_710)) (.cse40 (<= (+ v_idx_708 3) v_idx_710)) (.cse42 (<= .cse76 v_idx_708)) (.cse43 (<= .cse77 v_idx_708)) (.cse47 (<= (+ v_idx_708 2) v_idx_709)) (.cse45 (<= .cse77 v_idx_709)) (.cse46 (<= .cse76 v_idx_709)) (.cse36 (= (select |c_#memory_int| v_idx_708) 0))) (let ((.cse39 (<= (+ v_idx_708 1) v_idx_707)) (.cse34 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_707)) (.cse37 (<= v_idx_709 v_idx_707)) (.cse38 (<= .cse61 v_idx_707)) (.cse41 (<= (+ v_idx_709 1) v_idx_708)) (.cse35 (<= (+ v_idx_709 2) v_idx_710)) (.cse62 (<= (+ v_idx_710 1) v_idx_709)) (.cse69 (or (and .cse45 .cse46 .cse42 .cse43) (and .cse45 .cse47 .cse46) (and .cse45 .cse46 .cse36))) (.cse49 (<= v_idx_711 v_idx_709)) (.cse48 (and .cse45 .cse47 .cse31 .cse46 .cse32 .cse40)) (.cse29 (or .cse28 .cse52 .cse56)) (.cse33 (<= (+ v_idx_711 1) v_idx_710)) (.cse64 (<= (* 2 .cse72) 0)) (.cse66 (or .cse28 .cse52 (and .cse73 (<= (+ .cse72 .cse74) 0) .cse75))) (.cse67 (<= .cse72 0))) (let ((.cse44 (and .cse64 .cse66 .cse67)) (.cse54 (and .cse29 (let ((.cse71 (or (and .cse31 .cse32 .cse40) (and .cse31 .cse36 .cse32) (and .cse31 .cse32 .cse42 .cse43)))) (or (and .cse31 .cse71 .cse32) (and .cse31 .cse33 .cse71 .cse32))))) (.cse57 (and .cse45 .cse29 .cse46 (let ((.cse70 (or .cse48 (and .cse45 .cse31 .cse46 .cse36 .cse32) (and .cse45 .cse31 .cse46 .cse32 .cse42 .cse43)))) (or (and .cse45 .cse31 .cse46 .cse70 .cse33 .cse49 .cse32) (and .cse45 .cse31 .cse46 .cse70 .cse32))))) (.cse58 (and (or (and .cse45 .cse69 .cse46 .cse49) (and .cse45 .cse69 .cse46)) .cse45 .cse46 .cse64 .cse66 .cse67)) (.cse59 (and .cse45 .cse29 .cse46 .cse62 (or (and .cse45 .cse69 .cse46 .cse62) (and .cse45 .cse69 .cse46 .cse62 .cse49)))) (.cse60 (and (let ((.cse68 (or (and .cse31 .cse35 .cse32 .cse41 .cse42 .cse43) (and .cse31 .cse35 .cse36 .cse32) (and .cse31 .cse35 .cse32 .cse40)))) (or (and .cse31 .cse33 .cse32 .cse68) (and .cse31 .cse32 .cse68))) .cse29)) (.cse55 (or (and .cse39 .cse34 .cse37 .cse38) (and .cse34 .cse41 .cse37 .cse42 .cse38 .cse43) (and .cse34 .cse36 .cse37 .cse38))) (.cse53 (or (and .cse34 .cse36 .cse38) (and .cse34 .cse42 .cse38 .cse43) (and .cse39 .cse34 .cse38)))) (or .cse28 (and .cse29 (let ((.cse30 (or (and .cse34 .cse31 .cse35 .cse36 .cse32 .cse37 .cse38) (and .cse39 .cse34 .cse31 .cse35 .cse32 .cse37 .cse40 .cse38) (and .cse34 .cse31 .cse35 .cse32 .cse41 .cse37 .cse42 .cse38 .cse43)))) (or (and .cse30 .cse31 .cse32) (and .cse30 .cse31 .cse33 .cse32)))) .cse44 (and .cse45 .cse29 .cse46 (let ((.cse50 (or (and .cse45 .cse31 .cse46 .cse32) (and .cse45 .cse31 .cse46 .cse33 .cse49 .cse32)))) (or (and .cse39 .cse34 .cse45 .cse47 (or .cse48 (and .cse45 .cse47 .cse31 .cse46 .cse33 .cse49 .cse32 .cse40)) .cse46 .cse38) (and .cse34 .cse45 .cse46 .cse50 .cse42 .cse38 .cse43) (and .cse34 .cse45 .cse46 .cse36 .cse50 .cse38)))) (and .cse29 (let ((.cse51 (or (and .cse34 .cse31 .cse36 .cse32 .cse38) (and .cse39 .cse34 .cse31 .cse32 .cse40 .cse38) (and .cse34 .cse31 .cse32 .cse42 .cse38 .cse43)))) (or (and .cse31 .cse32 .cse51) (and .cse31 .cse33 .cse32 .cse51)))) .cse52 (and .cse53 .cse29) .cse54 (and .cse29 .cse55) .cse56 (and (or .cse28 .cse57 .cse44 .cse58 .cse59 .cse60 .cse52 .cse54 .cse56) (< v_idx_707 .cse61)) .cse57 .cse58 (and .cse45 .cse29 .cse46 .cse62 (let ((.cse63 (or (and .cse45 .cse46 .cse62 .cse49) (and .cse45 .cse46 .cse62)))) (or (and .cse34 .cse63 .cse45 .cse46 .cse36 .cse38) (and .cse34 .cse63 .cse45 .cse46 .cse42 .cse38 .cse43) (and .cse39 .cse34 .cse45 .cse47 .cse46 (or (and .cse45 .cse47 .cse46 .cse62 .cse49) (and .cse45 .cse47 .cse46 .cse62)) .cse38)))) .cse59 .cse60 (and .cse45 .cse46 .cse64 (let ((.cse65 (or (and .cse34 .cse45 .cse46 .cse42 .cse38 .cse43) (and .cse39 .cse34 .cse45 .cse47 .cse46 .cse38) (and .cse34 .cse45 .cse46 .cse36 .cse38)))) (or (and .cse45 .cse46 .cse65) (and .cse45 .cse46 .cse65 .cse49))) .cse66 .cse67) (and .cse64 .cse66 .cse67 .cse55) (and .cse53 .cse64 .cse66 .cse67))))))) (<= .cse78 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_704) 0) (< v_idx_704 c_ULTIMATE.start_main_p1) (<= .cse78 v_idx_704)))))) is different from false [2019-02-25 15:53:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:50,447 INFO L93 Difference]: Finished difference Result 33 states and 62 transitions. [2019-02-25 15:53:50,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:50,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-25 15:53:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:50,448 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:53:50,448 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:53:50,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10, Invalid=8, Unknown=2, NotChecked=10, Total=30 [2019-02-25 15:53:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:53:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2019-02-25 15:53:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:53:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 40 transitions. [2019-02-25 15:53:50,477 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 40 transitions. Word has length 4 [2019-02-25 15:53:50,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:50,478 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 40 transitions. [2019-02-25 15:53:50,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:53:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 40 transitions. [2019-02-25 15:53:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:50,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:50,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:50,479 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:50,479 INFO L82 PathProgramCache]: Analyzing trace with hash 943446, now seen corresponding path program 1 times [2019-02-25 15:53:50,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:50,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:50,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:53:50,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:53:50,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:50,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:53:50,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:53:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:53:50,536 INFO L87 Difference]: Start difference. First operand 17 states and 40 transitions. Second operand 3 states. [2019-02-25 15:53:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:50,591 INFO L93 Difference]: Finished difference Result 20 states and 42 transitions. [2019-02-25 15:53:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:53:50,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:53:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:50,592 INFO L225 Difference]: With dead ends: 20 [2019-02-25 15:53:50,592 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:53:50,593 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-02-25 15:53:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:53:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:53:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:53:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 39 transitions. [2019-02-25 15:53:50,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 39 transitions. Word has length 4 [2019-02-25 15:53:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:50,621 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 39 transitions. [2019-02-25 15:53:50,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:53:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 39 transitions. [2019-02-25 15:53:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:50,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:50,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:50,622 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 2 times [2019-02-25 15:53:50,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:50,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:50,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:50,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:50,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:50,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:50,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:50,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:50,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:50,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:53:50,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:50,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:53:50,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:50,730 INFO L467 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-02-25 15:53:50,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,734 INFO L467 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-02-25 15:53:50,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,745 INFO L467 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-02-25 15:53:50,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,755 INFO L467 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-02-25 15:53:50,755 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,782 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,797 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,806 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,822 INFO L301 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-02-25 15:53:50,823 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-25 15:53:50,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,849 INFO L467 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-02-25 15:53:50,850 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,877 INFO L301 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-02-25 15:53:50,877 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-25 15:53:50,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,940 INFO L467 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 31 treesize of output 45 [2019-02-25 15:53:50,941 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,993 INFO L301 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-02-25 15:53:50,993 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-25 15:53:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:51,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:51,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:51,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:51,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:51,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:51,095 INFO L87 Difference]: Start difference. First operand 17 states and 39 transitions. Second operand 8 states. [2019-02-25 15:53:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:51,505 INFO L93 Difference]: Finished difference Result 46 states and 81 transitions. [2019-02-25 15:53:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:51,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:51,507 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:53:51,507 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:53:51,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:53:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:53:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 20. [2019-02-25 15:53:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:53:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 51 transitions. [2019-02-25 15:53:51,547 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 51 transitions. Word has length 4 [2019-02-25 15:53:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 51 transitions. [2019-02-25 15:53:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 51 transitions. [2019-02-25 15:53:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:51,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:51,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:51,548 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-25 15:53:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:51,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:51,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:51,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:51,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:51,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:51,647 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-25 15:53:51,649 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:51,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:56,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:53:56,118 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:56,119 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:53:57,015 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2019-02-25 15:53:57,016 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:53:57,355 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-25 15:53:57,355 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:53:57,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:53:57,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-25 15:53:57,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:57,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:53:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:53:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:53:57,356 INFO L87 Difference]: Start difference. First operand 20 states and 51 transitions. Second operand 4 states. [2019-02-25 15:53:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:57,640 INFO L93 Difference]: Finished difference Result 28 states and 62 transitions. [2019-02-25 15:53:57,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:53:57,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:53:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:57,641 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:53:57,641 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:53:57,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:53:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:53:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-02-25 15:53:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:53:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 54 transitions. [2019-02-25 15:53:57,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 54 transitions. Word has length 4 [2019-02-25 15:53:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:57,690 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 54 transitions. [2019-02-25 15:53:57,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:53:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 54 transitions. [2019-02-25 15:53:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:57,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:57,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:57,691 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-25 15:53:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:57,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:57,790 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:57,790 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-25 15:53:57,792 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:57,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:08,476 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:54:08,476 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:54:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:08,477 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:54:09,101 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2019-02-25 15:54:09,101 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:54:10,155 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-25 15:54:10,155 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:54:10,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:54:10,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-02-25 15:54:10,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:54:10,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:54:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:54:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:54:10,157 INFO L87 Difference]: Start difference. First operand 20 states and 54 transitions. Second operand 4 states. [2019-02-25 15:54:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:20,689 INFO L93 Difference]: Finished difference Result 35 states and 89 transitions. [2019-02-25 15:54:20,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:54:20,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:54:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:20,690 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:54:20,690 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:54:20,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:54:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:54:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2019-02-25 15:54:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:54:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 64 transitions. [2019-02-25 15:54:20,804 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 64 transitions. Word has length 4 [2019-02-25 15:54:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:20,804 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 64 transitions. [2019-02-25 15:54:20,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:54:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 64 transitions. [2019-02-25 15:54:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:20,805 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:20,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:20,805 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 933646, now seen corresponding path program 2 times [2019-02-25 15:54:20,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:20,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:20,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:20,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:20,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:20,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:20,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:20,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:20,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:20,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:20,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:20,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:20,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:54:20,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:20,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:54:20,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:20,978 INFO L467 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-02-25 15:54:20,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,983 INFO L467 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-02-25 15:54:20,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,991 INFO L467 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-02-25 15:54:20,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,002 INFO L467 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-02-25 15:54:21,002 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:21,025 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:21,040 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:21,047 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:21,059 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:21,060 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-25 15:54:21,248 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-02-25 15:54:21,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,423 INFO L292 Elim1Store]: Index analysis took 171 ms [2019-02-25 15:54:21,424 INFO L467 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-02-25 15:54:21,425 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:21,722 INFO L301 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-02-25 15:54:21,723 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-25 15:54:21,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:21,748 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:21,749 INFO L467 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 33 treesize of output 47 [2019-02-25 15:54:21,750 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:21,780 INFO L301 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-02-25 15:54:21,781 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-25 15:54:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:21,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:21,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:21,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:21,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:21,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:21,840 INFO L87 Difference]: Start difference. First operand 22 states and 64 transitions. Second operand 8 states. [2019-02-25 15:54:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:22,259 INFO L93 Difference]: Finished difference Result 47 states and 103 transitions. [2019-02-25 15:54:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:22,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:54:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:22,260 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:54:22,260 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:54:22,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:54:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2019-02-25 15:54:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:54:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 79 transitions. [2019-02-25 15:54:22,341 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 79 transitions. Word has length 4 [2019-02-25 15:54:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:22,341 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 79 transitions. [2019-02-25 15:54:22,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 79 transitions. [2019-02-25 15:54:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:54:22,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:22,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:54:22,343 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash 937490, now seen corresponding path program 1 times [2019-02-25 15:54:22,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:22,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:22,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:22,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:22,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:22,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:22,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:22,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:54:22,441 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-25 15:54:22,442 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:22,442 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:36,420 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-25 15:54:36,420 INFO L272 AbstractInterpreter]: Visited 4 different actions 34 times. Merged at 2 different actions 10 times. Widened at 2 different actions 6 times. Found 12 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:54:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:36,421 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-25 15:54:37,297 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-02-25 15:54:37,297 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-25 15:54:42,898 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-25 15:54:42,898 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-25 15:54:42,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:54:42,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-25 15:54:42,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:54:42,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:54:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:54:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=0, Total=20 [2019-02-25 15:54:42,900 INFO L87 Difference]: Start difference. First operand 25 states and 79 transitions. Second operand 5 states. [2019-02-25 15:54:45,095 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1137 Int) (v_idx_1136 Int) (v_idx_1142 Int) (v_idx_1141 Int) (v_idx_1140 Int) (v_idx_1139 Int) (v_idx_1138 Int)) (let ((.cse56 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (<= .cse56 c_ULTIMATE.start_main_p4))) (and (or (< v_idx_1136 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_1136)) (<= .cse0 v_idx_1136)) (let ((.cse52 (select |c_#memory_int| v_idx_1142)) (.cse42 (+ c_ULTIMATE.start_main_p1 2)) (.cse54 (+ v_idx_1138 3)) (.cse55 (+ v_idx_1141 1)) (.cse53 (+ v_idx_1139 2))) (let ((.cse34 (<= (+ v_idx_1140 1) v_idx_1139)) (.cse31 (<= (+ v_idx_1140 2) c_ULTIMATE.start_main_p4)) (.cse49 (<= .cse53 v_idx_1140)) (.cse47 (<= .cse56 v_idx_1140)) (.cse48 (<= .cse55 v_idx_1140)) (.cse50 (<= .cse54 v_idx_1140)) (.cse10 (<= .cse42 v_idx_1139)) (.cse17 (<= (+ v_idx_1138 2) v_idx_1139)) (.cse41 (<= v_idx_1141 v_idx_1139)) (.cse40 (<= .cse55 c_ULTIMATE.start_main_p4)) (.cse39 (<= c_ULTIMATE.start_main_p4 v_idx_1141)) (.cse15 (<= .cse54 c_ULTIMATE.start_main_p4)) (.cse8 (<= .cse53 c_ULTIMATE.start_main_p4)) (.cse43 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1142)) (.cse44 (< v_idx_1142 c_ULTIMATE.start_main_p4)) (.cse45 (<= .cse52 0)) (.cse51 (select |c_#memory_int| v_idx_1140)) (.cse46 (<= (* 2 .cse52) 0))) (let ((.cse2 (or .cse43 .cse44 (and .cse45 (<= .cse52 .cse51) .cse46))) (.cse19 (or (and .cse15 .cse40 .cse6 .cse8) (and .cse15 .cse39 .cse6 .cse8) (and .cse15 .cse6 .cse8))) (.cse20 (or (and .cse15 .cse40 .cse6) (and .cse15 .cse6) (and .cse15 .cse39 .cse6))) (.cse18 (or (and .cse15 .cse10 .cse17 .cse39 .cse6) (and .cse15 .cse10 .cse17 .cse6) (and .cse15 .cse10 .cse17 .cse40 .cse6 .cse41))) (.cse11 (or (and .cse10 .cse39 .cse6) (and .cse10 .cse6) (and .cse10 .cse40 .cse6 .cse41))) (.cse4 (or (and .cse40 .cse6 .cse8) (and .cse39 .cse6 .cse8) (and .cse6 .cse8))) (.cse9 (or (and .cse39 .cse6) (and .cse40 .cse6) .cse6)) (.cse3 (<= 0 (* 2 .cse51))) (.cse21 (<= 0 .cse51)) (.cse27 (or (and .cse15 .cse10 .cse17 .cse47 .cse39 .cse50 .cse6) (and .cse15 .cse10 .cse17 .cse47 .cse50 .cse6) (and .cse15 .cse10 .cse17 .cse47 .cse40 .cse48 .cse50 .cse6 .cse41))) (.cse28 (or (and .cse15 .cse47 .cse39 .cse49 .cse50 .cse6 .cse8) (and .cse15 .cse47 .cse40 .cse48 .cse49 .cse50 .cse6 .cse8) (and .cse15 .cse47 .cse49 .cse50 .cse6 .cse8))) (.cse29 (or (and .cse15 .cse47 .cse39 .cse50 .cse6) (and .cse15 .cse47 .cse40 .cse48 .cse50 .cse6) (and .cse15 .cse47 .cse50 .cse6))) (.cse24 (or (and .cse10 .cse47 .cse39 .cse6) (and .cse10 .cse47 .cse40 .cse48 .cse6 .cse41) (and .cse10 .cse47 .cse6))) (.cse25 (or (and .cse47 .cse49 .cse6 .cse8) (and .cse47 .cse39 .cse49 .cse6 .cse8) (and .cse47 .cse40 .cse48 .cse49 .cse6 .cse8))) (.cse26 (or (and .cse47 .cse6) (and .cse47 .cse39 .cse6) (and .cse47 .cse40 .cse48 .cse6))) (.cse30 (or .cse43 .cse44 (and .cse45 .cse46))) (.cse12 (= 0 (select |c_#memory_int| v_idx_1138))) (.cse35 (or (and .cse10 .cse34 .cse31 .cse39 .cse6) (and .cse10 .cse34 .cse31 .cse40 .cse6 .cse41) (and .cse10 .cse34 .cse31 .cse6))) (.cse32 (or (and .cse31 .cse40 .cse6 .cse8) (and .cse31 .cse6 .cse8) (and .cse31 .cse39 .cse6 .cse8))) (.cse14 (<= (+ v_idx_1139 1) v_idx_1138)) (.cse33 (or (and .cse31 .cse40 .cse6) (and .cse31 .cse39 .cse6) (and .cse31 .cse6))) (.cse13 (<= .cse42 v_idx_1138)) (.cse36 (or (and .cse15 .cse10 .cse34 .cse31 .cse17 .cse6) (and .cse15 .cse10 .cse34 .cse31 .cse17 .cse40 .cse6 .cse41) (and .cse15 .cse10 .cse34 .cse31 .cse17 .cse39 .cse6))) (.cse37 (or (and .cse15 .cse31 .cse39 .cse6) (and .cse15 .cse31 .cse6) (and .cse15 .cse31 .cse40 .cse6))) (.cse38 (or (and .cse15 .cse31 .cse39 .cse6 .cse8) (and .cse15 .cse31 .cse6 .cse8) (and .cse15 .cse31 .cse40 .cse6 .cse8)))) (let ((.cse1 (and .cse30 (or (and (or (and .cse10 .cse34 .cse31 .cse35 .cse6) (and .cse31 .cse32 .cse6 .cse8) (and .cse33 .cse31 .cse6)) .cse6 .cse12) (and (or (and .cse10 .cse34 .cse13 .cse31 .cse35 .cse6) (and .cse13 .cse31 .cse32 .cse6 .cse8 .cse14) (and .cse33 .cse13 .cse31 .cse6)) .cse6) (and .cse15 (or (and .cse15 .cse10 .cse36 .cse34 .cse31 .cse17 .cse6) (and .cse15 .cse37 .cse31 .cse6) (and .cse38 .cse15 .cse31 .cse6 .cse8)) .cse6)))) (.cse22 (and .cse30 (or (and .cse15 (or (and .cse15 .cse10 .cse17 .cse6 .cse27) (and .cse15 .cse6 .cse8 .cse28) (and .cse15 .cse29 .cse6)) .cse6) (and (or (and .cse25 .cse6 .cse8) (and .cse10 .cse24 .cse6) (and .cse6 .cse26)) .cse6 .cse12) (and (or (and .cse10 .cse13 .cse24 .cse6) (and .cse13 .cse25 .cse6 .cse8 .cse14) (and .cse13 .cse6 .cse26)) .cse6)))) (.cse16 (<= (+ v_idx_1138 1) v_idx_1137)) (.cse5 (<= v_idx_1139 v_idx_1137)) (.cse7 (<= .cse0 v_idx_1137)) (.cse23 (and .cse2 (or (and (or (and .cse6 .cse9) (and .cse4 .cse6 .cse8) (and .cse10 .cse6 .cse11)) .cse6 .cse12) (and .cse15 (or (and .cse15 .cse19 .cse6 .cse8) (and .cse15 .cse20 .cse6) (and .cse15 .cse10 .cse17 .cse18 .cse6)) .cse6) (and (or (and .cse10 .cse13 .cse6 .cse11) (and .cse4 .cse13 .cse6 .cse8 .cse14) (and .cse13 .cse6 .cse9)) .cse6)) .cse3 .cse21))) (or .cse1 (and .cse2 .cse3 (or (and (or (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse9) (and .cse10 .cse6 .cse7 .cse11)) .cse6 .cse12 .cse7) (and (or (and .cse10 .cse13 .cse6 .cse7 .cse11) (and .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse14) (and .cse13 .cse6 .cse7 .cse9)) .cse6 .cse7) (and .cse15 .cse16 .cse6 .cse7 (or (and .cse15 .cse10 .cse17 .cse16 .cse18 .cse6 .cse7) (and .cse15 .cse19 .cse5 .cse16 .cse6 .cse7 .cse8) (and .cse15 .cse20 .cse16 .cse6 .cse7)))) .cse21) (and (< v_idx_1137 .cse0) (or .cse1 .cse22 .cse23)) .cse22 (and (or (and (or (and .cse10 .cse24 .cse6 .cse7) (and .cse5 .cse25 .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse26)) .cse6 .cse12 .cse7) (and .cse15 (or (and .cse15 .cse10 .cse17 .cse16 .cse6 .cse7 .cse27) (and .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse28) (and .cse15 .cse29 .cse16 .cse6 .cse7)) .cse16 .cse6 .cse7) (and (or (and .cse10 .cse13 .cse24 .cse6 .cse7) (and .cse13 .cse6 .cse7 .cse26) (and .cse5 .cse13 .cse25 .cse6 .cse7 .cse8 .cse14)) .cse6 .cse7)) .cse30) (and .cse30 (or (and (or (and .cse5 .cse31 .cse32 .cse6 .cse7 .cse8) (and .cse33 .cse31 .cse6 .cse7) (and .cse10 .cse34 .cse31 .cse35 .cse6 .cse7)) .cse6 .cse12 .cse7) (and .cse15 (or (and .cse15 .cse10 .cse36 .cse34 .cse31 .cse17 .cse16 .cse6 .cse7) (and .cse15 .cse37 .cse31 .cse16 .cse6 .cse7) (and .cse38 .cse15 .cse5 .cse31 .cse16 .cse6 .cse7 .cse8)) .cse16 .cse6 .cse7) (and (or (and .cse5 .cse13 .cse31 .cse32 .cse6 .cse7 .cse8 .cse14) (and .cse10 .cse34 .cse13 .cse31 .cse35 .cse6 .cse7) (and .cse33 .cse13 .cse31 .cse6 .cse7)) .cse6 .cse7))) .cse23))))) .cse6)))) (forall ((v_idx_1133 Int) (v_idx_1131 Int) (v_idx_1130 Int) (v_idx_1129 Int) (v_idx_1128 Int) (v_idx_1127 Int)) (let ((.cse75 (+ c_ULTIMATE.start_main_p1 2))) (let ((.cse57 (<= .cse75 c_ULTIMATE.start_main_p3)) (.cse73 (+ c_ULTIMATE.start_main_p1 1)) (.cse76 (+ c_ULTIMATE.start_main_p3 1)) (.cse60 (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4))) (and .cse57 (let ((.cse74 (+ v_idx_1130 1))) (let ((.cse64 (<= .cse74 v_idx_1129)) (.cse59 (<= .cse75 v_idx_1129)) (.cse61 (<= c_ULTIMATE.start_main_p3 v_idx_1130)) (.cse63 (<= (+ v_idx_1130 2) c_ULTIMATE.start_main_p4)) (.cse65 (<= .cse74 c_ULTIMATE.start_main_p3)) (.cse66 (<= (+ v_idx_1129 2) c_ULTIMATE.start_main_p3)) (.cse67 (<= (+ v_idx_1129 3) c_ULTIMATE.start_main_p4))) (let ((.cse68 (or (and .cse66 .cse57 .cse67 .cse60 .cse61) (and .cse66 .cse57 .cse67 .cse63 .cse60 .cse65) (and .cse66 .cse57 .cse67 .cse60))) (.cse70 (or (and .cse59 .cse57 .cse60) (and .cse59 .cse57 .cse63 .cse64 .cse60 .cse65) (and .cse59 .cse57 .cse60 .cse61))) (.cse62 (<= v_idx_1130 v_idx_1128)) (.cse58 (<= .cse73 v_idx_1128)) (.cse69 (< v_idx_1128 .cse73))) (or (and .cse57 .cse58 (or (and .cse59 .cse57 .cse58 .cse60 .cse61) (and .cse59 .cse57 .cse58 .cse62 .cse63 .cse64 .cse60 .cse65) (and .cse59 .cse57 .cse58 .cse60)) .cse60) (and .cse66 .cse57 .cse67 .cse68 .cse60) (and .cse66 .cse57 .cse67 .cse69 .cse68 .cse60) (and .cse57 .cse70 .cse60) (and .cse57 .cse70 .cse69 .cse60) (let ((.cse71 (<= (+ v_idx_1129 1) v_idx_1128))) (and .cse66 .cse57 .cse58 .cse67 .cse71 (or (and .cse66 .cse57 .cse58 .cse67 .cse71 .cse60) (and .cse66 .cse57 .cse58 .cse67 .cse71 .cse60 .cse61) (and .cse66 .cse57 .cse58 .cse67 .cse71 .cse62 .cse63 .cse60 .cse65)) .cse60)) (and (= (select |c_#memory_int| v_idx_1129) 0) (let ((.cse72 (or (and .cse57 .cse60) (and .cse57 .cse63 .cse60 .cse65) (and .cse57 .cse60 .cse61)))) (or (and .cse57 .cse72 .cse60) (and .cse57 .cse58 (or (and .cse57 .cse58 .cse62 .cse63 .cse60 .cse65) (and .cse57 .cse58 .cse60) (and .cse57 .cse58 .cse60 .cse61)) .cse60) (and .cse57 .cse69 .cse72 .cse60)))))))) (<= .cse76 c_ULTIMATE.start_main_p4) (or (< v_idx_1127 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_1127)) (<= .cse73 v_idx_1127)) (let ((.cse80 (select |c_#memory_int| v_idx_1133))) (let ((.cse78 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1133)) (.cse79 (<= .cse80 0)) (.cse81 (<= (* 2 .cse80) 0)) (.cse82 (< v_idx_1133 c_ULTIMATE.start_main_p4))) (let ((.cse83 (or .cse78 (and .cse79 .cse81) .cse82))) (or (let ((.cse77 (select |c_#memory_int| v_idx_1131))) (and (<= 0 .cse77) (or .cse78 (and .cse79 (<= .cse80 .cse77) .cse81) .cse82) (<= 0 (* 2 .cse77)))) (and .cse83 (<= .cse76 v_idx_1131)) (and (< v_idx_1131 c_ULTIMATE.start_main_p3) .cse83))))) .cse60))))) is different from false [2019-02-25 15:54:59,694 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:54:59,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:54:59,696 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.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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) ... 41 more [2019-02-25 15:54:59,700 INFO L168 Benchmark]: Toolchain (without parser) took 204206.19 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 107.6 MB in the beginning and 394.4 MB in the end (delta: -286.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-02-25 15:54:59,701 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:54:59,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.69 ms. Allocated memory is still 140.0 MB. Free memory was 107.1 MB in the beginning and 104.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:59,702 INFO L168 Benchmark]: Boogie Preprocessor took 27.92 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 104.0 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. [2019-02-25 15:54:59,702 INFO L168 Benchmark]: RCFGBuilder took 365.76 ms. Allocated memory is still 140.0 MB. Free memory was 104.0 MB in the beginning and 93.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:54:59,703 INFO L168 Benchmark]: TraceAbstraction took 203742.85 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.0 MB in the beginning and 394.4 MB in the end (delta: -301.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-02-25 15:54:59,707 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.21 ms. Allocated memory is still 140.0 MB. Free memory is still 108.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.69 ms. Allocated memory is still 140.0 MB. Free memory was 107.1 MB in the beginning and 104.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.92 ms. Allocated memory is still 140.0 MB. Free memory was 104.9 MB in the beginning and 104.0 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 365.76 ms. Allocated memory is still 140.0 MB. Free memory was 104.0 MB in the beginning and 93.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203742.85 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.0 MB in the beginning and 394.4 MB in the end (delta: -301.4 MB). Peak memory consumption was 2.3 GB. 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...