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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:41:31,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:41:31,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:41:31,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:41:31,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:41:31,744 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:41:31,745 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:41:31,747 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:41:31,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:41:31,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:41:31,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:41:31,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:41:31,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:41:31,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:41:31,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:41:31,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:41:31,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:41:31,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:41:31,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:41:31,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:41:31,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:41:31,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:41:31,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:41:31,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:41:31,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:41:31,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:41:31,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:41:31,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:41:31,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:41:31,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:41:31,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:41:31,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:41:31,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:41:31,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:41:31,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:41:31,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:41:31,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 21:41:31,794 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:41:31,795 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:41:31,796 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:41:31,796 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:41:31,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:41:31,796 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:41:31,796 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:41:31,797 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:41:31,797 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:41:31,797 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:41:31,797 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:41:31,797 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:41:31,798 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:41:31,798 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:41:31,798 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:41:31,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:41:31,799 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:41:31,799 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:41:31,799 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:41:31,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:41:31,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:41:31,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:41:31,800 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:41:31,800 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:41:31,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:41:31,802 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:41:31,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:41:31,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:41:31,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:41:31,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:41:31,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:41:31,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:41:31,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:41:31,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:41:31,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:41:31,805 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:41:31,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:41:31,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:41:31,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:41:31,805 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:41:31,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:41:31,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:41:31,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:41:31,867 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:41:31,867 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:41:31,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-01-07 21:41:31,868 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-01-07 21:41:31,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:41:31,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:41:31,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:41:31,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:41:31,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:41:31,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:31,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:41:32,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:41:32,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:41:32,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:41:32,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... [2019-01-07 21:41:32,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:41:32,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:41:32,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:41:32,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:41:32,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:41:32,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:41:32,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:41:32,453 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:41:32,453 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-07 21:41:32,455 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:41:32 BoogieIcfgContainer [2019-01-07 21:41:32,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:41:32,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:41:32,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:41:32,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:41:32,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:41:31" (1/2) ... [2019-01-07 21:41:32,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f3d9d and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:41:32, skipping insertion in model container [2019-01-07 21:41:32,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:41:32" (2/2) ... [2019-01-07 21:41:32,463 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-01-07 21:41:32,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:41:32,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-07 21:41:32,529 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-07 21:41:32,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:41:32,566 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:41:32,566 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:41:32,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:41:32,566 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:41:32,567 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:41:32,567 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:41:32,567 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:41:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-07 21:41:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 21:41:32,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:32,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 21:41:32,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-07 21:41:32,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:32,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:32,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:32,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:32,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:32,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:41:32,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:41:32,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:32,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:41:32,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:41:32,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:41:32,807 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-07 21:41:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:33,018 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-07 21:41:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:41:33,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 21:41:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:33,034 INFO L225 Difference]: With dead ends: 29 [2019-01-07 21:41:33,035 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 21:41:33,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:41:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 21:41:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-07 21:41:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 21:41:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-07 21:41:33,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-07 21:41:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:33,073 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-07 21:41:33,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:41:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-07 21:41:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:33,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:33,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:33,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:33,075 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-07 21:41:33,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:33,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:33,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:33,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:33,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:33,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:33,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:33,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:33,209 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-07 21:41:33,248 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:33,248 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:33,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:33,333 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:41:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:33,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:33,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:33,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:33,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:33,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:33,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:33,768 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-07 21:41:33,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:33,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:33,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:33,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:33,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:33,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:33,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:33,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:33,986 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:34,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:34,269 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:34,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:34,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:34,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:34,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:34,471 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:34,649 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-07 21:41:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:34,872 INFO L303 Elim1Store]: Index analysis took 204 ms [2019-01-07 21:41:34,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-07 21:41:34,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:35,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:35,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:35,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:35,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:35,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:35,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:35,176 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-07 21:41:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:36,997 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-07 21:41:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:37,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:41:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:37,005 INFO L225 Difference]: With dead ends: 47 [2019-01-07 21:41:37,006 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 21:41:37,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:41:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 21:41:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-07 21:41:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 21:41:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-07 21:41:37,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-07 21:41:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:37,014 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-07 21:41:37,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-07 21:41:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:37,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:37,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:37,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:37,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,016 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-07 21:41:37,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:37,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:37,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:37,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:37,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:37,089 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-07 21:41:37,095 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:37,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:37,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:37,185 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:41:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:37,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:37,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:37,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:37,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:37,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:37,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:37,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,628 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:37,835 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:37,865 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:37,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:41:37,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:38,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:41:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 21:41:38,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:41:38,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:41:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:41:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:41:38,120 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-07 21:41:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:38,190 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-07 21:41:38,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:41:38,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 21:41:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:38,191 INFO L225 Difference]: With dead ends: 23 [2019-01-07 21:41:38,191 INFO L226 Difference]: Without dead ends: 22 [2019-01-07 21:41:38,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:41:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-07 21:41:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-07 21:41:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 21:41:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-07 21:41:38,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-07 21:41:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:38,198 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-07 21:41:38,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:41:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-07 21:41:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:38,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:38,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:38,200 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-07 21:41:38,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:38,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:38,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:38,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:38,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:38,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:38,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:38,283 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-07 21:41:38,284 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:38,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:38,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:38,293 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:41:38,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:38,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:38,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:38,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:38,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:38,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:38,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:38,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:38,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:38,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:38,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:38,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:38,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,715 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-07 21:41:38,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:38,717 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,809 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,848 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:38,939 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:38,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:38,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:41:38,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:39,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:39,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:39,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:39,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:39,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:39,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:39,165 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-07 21:41:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:40,626 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-01-07 21:41:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:40,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:41:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:40,629 INFO L225 Difference]: With dead ends: 50 [2019-01-07 21:41:40,629 INFO L226 Difference]: Without dead ends: 47 [2019-01-07 21:41:40,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:41:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-07 21:41:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-01-07 21:41:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-07 21:41:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-01-07 21:41:40,638 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-01-07 21:41:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:40,638 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-01-07 21:41:40,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-01-07 21:41:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:41:40,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:40,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:41:40,640 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-07 21:41:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:40,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:40,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:40,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:40,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:41:40,733 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-07 21:41:40,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:40,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:40,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:40,742 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:41:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:40,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:40,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:40,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:40,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:40,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:40,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:40,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:40,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:40,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:40,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:40,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:40,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:40,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:40,939 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,053 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:41,201 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:41,234 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:41,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:41,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:41:41,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:41,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:41,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:41,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:41,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:41,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:41:41,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:41,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:41:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:41:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:41:41,560 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-01-07 21:41:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:42,607 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-01-07 21:41:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:41:42,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:41:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:42,610 INFO L225 Difference]: With dead ends: 50 [2019-01-07 21:41:42,610 INFO L226 Difference]: Without dead ends: 48 [2019-01-07 21:41:42,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:41:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-07 21:41:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-07 21:41:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 21:41:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-01-07 21:41:42,619 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-01-07 21:41:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:42,619 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-01-07 21:41:42,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:41:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-01-07 21:41:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:42,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:42,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:42,620 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-07 21:41:42,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:42,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:42,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:42,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:42,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:42,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:42,760 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-07 21:41:42,762 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:42,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:42,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:42,770 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:42,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:42,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:42,771 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:42,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:42,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:42,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:42,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:42,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:42,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,023 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-07 21:41:43,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:43,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:43,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,122 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:43,210 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:43,237 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:43,455 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-07 21:41:43,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,561 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-07 21:41:43,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-07 21:41:43,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:43,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:43,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-07 21:41:43,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:43,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-07 21:41:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:43,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:43,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:43,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:43,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:43,985 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-01-07 21:41:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:46,795 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-01-07 21:41:46,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:46,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:46,797 INFO L225 Difference]: With dead ends: 62 [2019-01-07 21:41:46,797 INFO L226 Difference]: Without dead ends: 58 [2019-01-07 21:41:46,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-07 21:41:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-01-07 21:41:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:41:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-01-07 21:41:46,808 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-01-07 21:41:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:46,808 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-01-07 21:41:46,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-01-07 21:41:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:46,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:46,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:46,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-07 21:41:46,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:46,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:46,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:46,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:46,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:46,924 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-07 21:41:46,925 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:46,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:46,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:46,933 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:46,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:46,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:46,934 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:46,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:46,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:46,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:46,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:46,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:47,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:47,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:47,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:47,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:47,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:47,087 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,128 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,150 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:47,225 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:47,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-07 21:41:47,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:47,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:47,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:47,403 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:47,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-07 21:41:47,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:47,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:47,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-07 21:41:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:47,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:47,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:47,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:47,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:47,728 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-01-07 21:41:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:50,607 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-01-07 21:41:50,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:50,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:50,609 INFO L225 Difference]: With dead ends: 60 [2019-01-07 21:41:50,609 INFO L226 Difference]: Without dead ends: 56 [2019-01-07 21:41:50,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-07 21:41:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-07 21:41:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:41:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-07 21:41:50,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-07 21:41:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:50,620 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-07 21:41:50,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-07 21:41:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:50,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:50,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:50,621 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-07 21:41:50,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:50,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:50,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:50,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:50,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:50,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:50,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:50,735 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-07 21:41:50,736 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:50,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:50,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:50,743 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:50,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:50,744 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:50,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:50,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:50,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:50,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:50,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:50,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:50,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:50,885 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:50,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:50,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:50,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:50,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:50,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:51,021 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:51,043 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:51,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-07 21:41:51,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:51,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:51,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:51,211 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:51,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-07 21:41:51,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:51,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:51,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-07 21:41:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:51,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:51,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:51,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:51,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:51,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:51,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:51,550 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-07 21:41:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:54,299 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-07 21:41:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:54,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:54,301 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:41:54,301 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:41:54,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:41:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-07 21:41:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:41:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-07 21:41:54,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-07 21:41:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:54,310 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-07 21:41:54,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-07 21:41:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:54,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:54,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:54,311 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-07 21:41:54,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:54,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:54,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:54,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:54,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:54,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:54,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:54,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:54,424 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-07 21:41:54,425 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:54,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:54,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:54,431 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:54,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:54,432 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:54,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:54,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:54,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:54,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:54,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:54,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:54,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:54,579 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:54,708 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:54,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-07 21:41:54,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:54,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-07 21:41:54,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:54,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-07 21:41:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:55,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:55,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:55,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:55,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:55,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:55,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:55,171 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-07 21:41:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:57,224 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-07 21:41:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:41:57,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:57,226 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:41:57,226 INFO L226 Difference]: Without dead ends: 53 [2019-01-07 21:41:57,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-07 21:41:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-07 21:41:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:41:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-07 21:41:57,238 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-07 21:41:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:57,238 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-07 21:41:57,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-07 21:41:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:57,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:57,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:57,240 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-07 21:41:57,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:57,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:57,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:57,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:57,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:57,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:57,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:57,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:57,315 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-07 21:41:57,316 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:57,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:57,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:57,328 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:57,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:57,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:57,329 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:57,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:57,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:57,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:57,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:41:57,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:57,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:57,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:57,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:41:57,511 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,552 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:57,672 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-07 21:41:57,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:41:57,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:57,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:57,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:57,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-07 21:41:57,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:57,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:57,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-07 21:41:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:58,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:41:58,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:58,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:41:58,071 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-07 21:41:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:59,736 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-01-07 21:41:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:41:59,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:41:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:59,738 INFO L225 Difference]: With dead ends: 77 [2019-01-07 21:41:59,738 INFO L226 Difference]: Without dead ends: 75 [2019-01-07 21:41:59,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:41:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-07 21:41:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-01-07 21:41:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:41:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-01-07 21:41:59,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-01-07 21:41:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:59,750 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-01-07 21:41:59,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-01-07 21:41:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:41:59,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:59,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:41:59,752 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-01-07 21:41:59,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:59,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:59,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:59,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:59,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:59,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:41:59,853 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-01-07 21:41:59,854 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:59,855 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:59,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:59,861 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:59,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:59,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:59,862 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:59,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:59,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:59,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-07 21:41:59,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:41:59,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:41:59,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-07 21:41:59,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-07 21:41:59,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-07 21:42:00,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,042 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:42:00,144 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:00,170 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-07 21:42:00,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-07 21:42:00,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:00,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-07 21:42:00,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-07 21:42:00,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:00,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-07 21:42:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:00,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:00,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:42:00,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:00,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:42:00,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:42:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:42:00,531 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-01-07 21:42:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:02,336 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-01-07 21:42:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:42:02,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:42:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:02,338 INFO L225 Difference]: With dead ends: 82 [2019-01-07 21:42:02,339 INFO L226 Difference]: Without dead ends: 79 [2019-01-07 21:42:02,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:42:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-07 21:42:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-01-07 21:42:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-07 21:42:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-01-07 21:42:02,350 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-01-07 21:42:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:02,350 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-01-07 21:42:02,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:42:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-01-07 21:42:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:42:02,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:02,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:42:02,352 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-07 21:42:02,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:02,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:02,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:02,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:02,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:02,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:02,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:42:02,431 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-07 21:42:02,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:02,434 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:02,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:02,443 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:42:02,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:02,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:02,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:02,443 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:02,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:02,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:02,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:02,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-07 21:42:02,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2019-01-07 21:42:02,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-07 21:42:02,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-07 21:42:02,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-07 21:42:02,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-07 21:42:02,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:02,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-07 21:42:02,567 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,605 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,627 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:02,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:02,738 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-07 21:42:04,785 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-07 21:42:04,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:04,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-07 21:42:04,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-07 21:42:05,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-07 21:42:05,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-01-07 21:42:17,120 WARN L181 SmtUtils]: Spent 11.68 s on a formula simplification that was a NOOP. DAG size: 106 [2019-01-07 21:42:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:17,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:42:17,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:17,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:42:17,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:17,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:42:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:42:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:42:17,235 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-01-07 21:42:51,372 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 21:42:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:42:51,375 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:191) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-01-07 21:42:51,379 INFO L168 Benchmark]: Toolchain (without parser) took 79447.45 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 749.0 MB. Max. memory is 7.1 GB. [2019-01-07 21:42:51,380 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:42:51,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:42:51,381 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:42:51,381 INFO L168 Benchmark]: RCFGBuilder took 417.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:42:51,382 INFO L168 Benchmark]: TraceAbstraction took 78922.09 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 727.9 MB. Max. memory is 7.1 GB. [2019-01-07 21:42:51,384 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 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 417.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78922.09 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 727.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...