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-b7bd044-m [2019-01-20 10:09:37,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:09:37,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:09:37,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:09:37,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:09:37,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:09:37,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:09:37,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:09:37,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:09:37,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:09:37,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:09:37,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:09:37,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:09:37,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:09:37,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:09:37,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:09:37,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:09:37,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:09:37,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:09:37,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:09:37,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:09:37,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:09:37,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:09:37,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:09:37,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:09:37,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:09:37,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:09:37,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:09:37,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:09:37,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:09:37,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:09:37,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:09:37,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:09:37,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:09:37,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:09:37,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:09:37,804 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-20 10:09:37,824 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:09:37,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:09:37,825 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:09:37,825 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:09:37,826 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:09:37,826 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:09:37,826 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:09:37,826 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:09:37,826 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:09:37,827 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:09:37,827 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:09:37,827 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:09:37,827 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:09:37,827 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:09:37,828 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:09:37,828 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:09:37,829 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:09:37,829 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:09:37,829 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:09:37,829 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:09:37,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:09:37,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:09:37,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:09:37,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:09:37,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:09:37,832 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:09:37,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:09:37,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:09:37,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:09:37,833 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:09:37,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:09:37,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:09:37,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:09:37,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:09:37,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:09:37,834 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:09:37,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:09:37,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:09:37,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:09:37,835 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:09:37,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:09:37,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:09:37,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:09:37,886 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:09:37,887 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:09:37,887 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-20 10:09:37,888 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-01-20 10:09:37,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:09:37,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:09:37,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:09:37,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:09:37,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:09:37,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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:37,967 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:37,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:09:37,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:09:37,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:09:37,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:09:38,011 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,011 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,013 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,014 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,021 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,025 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,027 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 20.01 10:09:37" (1/1) ... [2019-01-20 10:09:38,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:09:38,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:09:38,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:09:38,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:09:38,032 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 20.01 10:09:37" (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-20 10:09:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:09:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:09:38,463 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:09:38,463 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-20 10:09:38,465 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:38 BoogieIcfgContainer [2019-01-20 10:09:38,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:09:38,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:09:38,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:09:38,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:09:38,470 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 20.01 10:09:37" (1/2) ... [2019-01-20 10:09:38,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13054d52 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:38, skipping insertion in model container [2019-01-20 10:09:38,471 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 20.01 10:09:38" (2/2) ... [2019-01-20 10:09:38,473 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-01-20 10:09:38,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:09:38,490 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-20 10:09:38,507 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-20 10:09:38,537 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:09:38,538 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:09:38,538 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:09:38,538 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:09:38,538 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:09:38,538 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:09:38,539 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:09:38,539 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:09:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-20 10:09:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:09:38,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:38,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:09:38,560 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-20 10:09:38,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:38,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:38,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:38,750 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-20 10:09:38,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:09:38,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:09:38,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:38,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:09:38,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:09:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:38,778 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-20 10:09:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:39,060 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-20 10:09:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:39,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:09:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:39,078 INFO L225 Difference]: With dead ends: 29 [2019-01-20 10:09:39,078 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:09:39,082 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-20 10:09:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:09:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-20 10:09:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:09:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-20 10:09:39,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-20 10:09:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:39,115 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-20 10:09:39,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:09:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-20 10:09:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:39,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:39,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:39,117 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-20 10:09:39,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:39,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:39,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:39,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-20 10:09:39,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:39,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:39,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:39,286 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-20 10:09:39,347 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:39,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:39,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:39,424 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-20 10:09:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:39,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:39,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:39,431 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-20 10:09:39,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:39,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:39,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:39,843 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-20 10:09:39,878 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-20 10:09:39,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,956 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-20 10:09:40,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,003 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-20 10:09:40,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,062 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-20 10:09:40,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,083 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-20 10:09:40,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,148 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-20 10:09:40,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,182 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-20 10:09:40,184 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,388 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,424 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,551 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-20 10:09:40,551 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:40,723 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-20 10:09:40,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,909 INFO L303 Elim1Store]: Index analysis took 173 ms [2019-01-20 10:09:40,912 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-20 10:09:40,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:41,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-20 10:09:41,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:41,170 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-20 10:09:41,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:41,238 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-20 10:09:41,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:41,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:41,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:41,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:41,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:41,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:41,261 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-20 10:09:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:43,017 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-20 10:09:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:43,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:09:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:43,019 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:09:43,019 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:09:43,020 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-20 10:09:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:09:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-20 10:09:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:09:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-20 10:09:43,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-20 10:09:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:43,027 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-20 10:09:43,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-20 10:09:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:43,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:43,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:43,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-20 10:09:43,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:43,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:43,166 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-20 10:09:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:43,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:43,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:43,167 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-20 10:09:43,173 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:43,173 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:43,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:43,184 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-20 10:09:43,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:43,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:43,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:43,185 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-20 10:09:43,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:43,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:43,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:43,261 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-20 10:09:43,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,267 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-20 10:09:43,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,283 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-20 10:09:43,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,314 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-20 10:09:43,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,335 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-20 10:09:43,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,385 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-20 10:09:43,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,466 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,546 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,603 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,655 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-20 10:09:43,656 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,684 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-20 10:09:43,684 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,759 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-20 10:09:43,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,918 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-20 10:09:43,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:43,933 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-20 10:09:43,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:43,938 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-20 10:09:43,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:09:43,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:09:43,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:43,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:09:43,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:09:43,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:09:43,959 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-20 10:09:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:44,040 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-20 10:09:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:09:44,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:09:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:44,042 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:09:44,042 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 10:09:44,043 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-20 10:09:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 10:09:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-20 10:09:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:09:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-20 10:09:44,049 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-20 10:09:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:44,050 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-20 10:09:44,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:09:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-20 10:09:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:44,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:44,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:44,051 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-20 10:09:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:44,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:44,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:44,134 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-20 10:09:44,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:44,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:44,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:44,135 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-20 10:09:44,137 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:44,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:44,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:44,146 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-20 10:09:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:44,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:44,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:44,146 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-20 10:09:44,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:44,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:44,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:44,237 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-20 10:09:44,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,259 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-20 10:09:44,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,265 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-20 10:09:44,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,324 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-20 10:09:44,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,357 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-20 10:09:44,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,413 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-20 10:09:44,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,436 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-20 10:09:44,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,486 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,529 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,617 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-20 10:09:44,618 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:44,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:44,688 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-20 10:09:44,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:44,756 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-20 10:09:44,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:44,848 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-20 10:09:44,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:44,859 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-20 10:09:44,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:44,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:44,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:44,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:44,880 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-20 10:09:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:46,316 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-01-20 10:09:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:46,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:09:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:46,319 INFO L225 Difference]: With dead ends: 50 [2019-01-20 10:09:46,319 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:09:46,320 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-20 10:09:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:09:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-01-20 10:09:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:09:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-01-20 10:09:46,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-01-20 10:09:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:46,327 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-01-20 10:09:46,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-01-20 10:09:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:46,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:46,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:46,329 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-20 10:09:46,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:46,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:46,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:46,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:46,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:46,467 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-20 10:09:46,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:46,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:46,468 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:46,468 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-20 10:09:46,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:46,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:46,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:46,478 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-20 10:09:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:46,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:46,479 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-20 10:09:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:46,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:46,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:46,561 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-20 10:09:46,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,569 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-20 10:09:46,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,577 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-20 10:09:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,587 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-20 10:09:46,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,623 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-20 10:09:46,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,675 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-20 10:09:46,676 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,883 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-20 10:09:46,884 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,906 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-20 10:09:46,906 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:46,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,956 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-20 10:09:46,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,063 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-20 10:09:47,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:47,141 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-20 10:09:47,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:47,169 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-20 10:09:47,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:47,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:47,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:47,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:47,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:47,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:47,189 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-01-20 10:09:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:48,245 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-01-20 10:09:48,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:48,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:09:48,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:48,248 INFO L225 Difference]: With dead ends: 50 [2019-01-20 10:09:48,248 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:09:48,249 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-20 10:09:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:09:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-20 10:09:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:09:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-01-20 10:09:48,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-01-20 10:09:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:48,257 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-01-20 10:09:48,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-01-20 10:09:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:48,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:48,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:48,258 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-20 10:09:48,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:48,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:48,383 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-20 10:09:48,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:48,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:48,384 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:48,384 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-20 10:09:48,385 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:48,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:48,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:48,392 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-20 10:09:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:48,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:48,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:48,393 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-20 10:09:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:48,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:48,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:48,472 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-20 10:09:48,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,476 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-20 10:09:48,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,489 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-20 10:09:48,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,522 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-20 10:09:48,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,635 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-20 10:09:48,636 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-20 10:09:48,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,680 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-20 10:09:48,681 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,059 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,155 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-20 10:09:49,156 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,178 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-20 10:09:49,178 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:49,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,235 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-20 10:09:49,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,293 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-20 10:09:49,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:49,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,357 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-20 10:09:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,424 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-20 10:09:49,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-20 10:09:49,589 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-20 10:09:49,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:49,615 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-20 10:09:49,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:49,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:49,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:49,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:49,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:49,636 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-01-20 10:09:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:52,381 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-01-20 10:09:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:52,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:52,382 INFO L225 Difference]: With dead ends: 62 [2019-01-20 10:09:52,383 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:09:52,383 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-20 10:09:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:09:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-01-20 10:09:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:09:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-01-20 10:09:52,392 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-01-20 10:09:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:52,393 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-01-20 10:09:52,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-01-20 10:09:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:52,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:52,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:52,394 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-20 10:09:52,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:52,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:52,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:52,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:52,495 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-20 10:09:52,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:52,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:52,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:52,496 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-20 10:09:52,497 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:52,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:52,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:52,505 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-20 10:09:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:52,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:52,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:52,506 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-20 10:09:52,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:52,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:52,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:52,573 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-20 10:09:52,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,595 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-20 10:09:52,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,606 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-20 10:09:52,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,613 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-20 10:09:52,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,624 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-20 10:09:52,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,635 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-20 10:09:52,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,649 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-20 10:09:52,650 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,797 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-20 10:09:52,797 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:52,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,850 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-20 10:09:52,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,910 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-20 10:09:52,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:52,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:52,961 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-20 10:09:52,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,029 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-20 10:09:53,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-20 10:09:53,221 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-20 10:09:53,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:53,246 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-20 10:09:53,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:53,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:53,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:53,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:53,267 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-01-20 10:09:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:56,004 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-01-20 10:09:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:56,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:56,006 INFO L225 Difference]: With dead ends: 60 [2019-01-20 10:09:56,007 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:09:56,007 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-20 10:09:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:09:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-20 10:09:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:09:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-20 10:09:56,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-20 10:09:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:56,016 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-20 10:09:56,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-20 10:09:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:56,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:56,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:56,017 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-20 10:09:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:56,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:56,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:56,111 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-20 10:09:56,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:56,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:56,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:56,112 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-20 10:09:56,113 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:56,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:56,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:56,120 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-20 10:09:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:56,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:56,121 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-20 10:09:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:56,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:56,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:56,188 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-20 10:09:56,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,193 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-20 10:09:56,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,207 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-20 10:09:56,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,217 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-20 10:09:56,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,247 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-20 10:09:56,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,267 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-20 10:09:56,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,447 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-20 10:09:56,448 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,485 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-20 10:09:56,485 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-20 10:09:56,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,557 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-20 10:09:56,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,632 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-20 10:09:56,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-20 10:09:56,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,691 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:56,693 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-20 10:09:56,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,758 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-20 10:09:56,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-20 10:09:56,904 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-20 10:09:56,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:56,926 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-20 10:09:56,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:56,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:56,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:56,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:56,947 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-20 10:09:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:59,640 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-20 10:09:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:59,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:59,642 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:09:59,642 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:09:59,643 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-20 10:09:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:09:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-20 10:09:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:09:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-20 10:09:59,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-20 10:09:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:59,651 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-20 10:09:59,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-20 10:09:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:59,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:59,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:59,653 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-20 10:09:59,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:59,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:59,784 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-20 10:09:59,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:59,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:59,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:59,785 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-20 10:09:59,786 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:59,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:59,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:59,791 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-20 10:09:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:59,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:59,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:59,792 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-20 10:09:59,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:59,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:59,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:59,863 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-20 10:09:59,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,880 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-20 10:09:59,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,885 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-20 10:09:59,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,891 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-20 10:09:59,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,904 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-20 10:09:59,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,922 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-20 10:09:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,934 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-20 10:09:59,935 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,076 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,099 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,168 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-20 10:10:00,168 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-20 10:10:00,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,240 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-20 10:10:00,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,302 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-20 10:10:00,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-20 10:10:00,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,349 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-20 10:10:00,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,431 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-20 10:10:00,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-20 10:10:00,575 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-20 10:10:00,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:00,601 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-20 10:10:00,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:00,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:00,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:00,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:00,622 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-20 10:10:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:02,623 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-20 10:10:02,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:02,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:02,624 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:10:02,625 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:10:02,625 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-20 10:10:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:10:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-20 10:10:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:10:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-20 10:10:02,634 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-20 10:10:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:02,634 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-20 10:10:02,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-20 10:10:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:02,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:02,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:02,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-20 10:10:02,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:02,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:02,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:02,721 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-20 10:10:02,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:02,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:02,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:02,722 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-20 10:10:02,724 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:02,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:02,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:02,730 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-20 10:10:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:02,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:02,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:02,730 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-20 10:10:02,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:02,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:02,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:02,802 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-20 10:10:02,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,819 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-20 10:10:02,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,834 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-20 10:10:02,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,841 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-20 10:10:02,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,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-20 10:10:02,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,902 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-20 10:10:02,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,914 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-20 10:10:02,915 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,986 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,062 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-20 10:10:03,063 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-20 10:10:03,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,129 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-20 10:10:03,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,212 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-20 10:10:03,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-20 10:10:03,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,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, 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-20 10:10:03,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,378 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-20 10:10:03,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-20 10:10:03,462 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-20 10:10:03,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:03,482 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-20 10:10:03,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:03,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:03,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:03,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:03,501 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-20 10:10:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:05,176 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-01-20 10:10:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:05,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:05,178 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:10:05,178 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:10:05,179 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-20 10:10:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:10:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-01-20 10:10:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:10:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-01-20 10:10:05,188 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-01-20 10:10:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:05,188 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-01-20 10:10:05,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-01-20 10:10:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:05,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:05,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:05,190 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-01-20 10:10:05,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:05,283 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-20 10:10:05,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:05,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:05,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:05,284 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-01-20 10:10:05,285 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:05,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:05,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:05,290 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-20 10:10:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:05,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:05,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:05,291 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-20 10:10:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:05,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:05,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:05,363 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-20 10:10:05,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,371 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-20 10:10:05,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,375 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-20 10:10:05,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,388 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-20 10:10:05,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,405 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-20 10:10:05,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,426 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-20 10:10:05,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,554 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-20 10:10:05,554 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,576 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-20 10:10:05,577 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-20 10:10:05,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,621 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-20 10:10:05,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,692 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-20 10:10:05,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-20 10:10:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,730 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-20 10:10:05,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,795 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-20 10:10:05,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-20 10:10:06,110 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-20 10:10:06,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:06,348 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-20 10:10:06,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:06,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:06,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:06,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:06,368 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-01-20 10:10:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:08,070 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-01-20 10:10:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:08,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:08,072 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:10:08,072 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:10:08,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:10:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-01-20 10:10:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 10:10:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-01-20 10:10:08,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-01-20 10:10:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:08,083 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-01-20 10:10:08,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-01-20 10:10:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:08,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:08,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:08,085 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-20 10:10:08,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:08,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:08,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:08,159 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-20 10:10:08,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:08,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:08,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:08,160 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-20 10:10:08,161 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:08,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:08,169 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:08,170 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-20 10:10:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:08,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:08,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:08,170 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-20 10:10:08,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:08,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:08,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:08,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, 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-20 10:10:08,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,225 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-20 10:10:08,229 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-20 10:10:08,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,236 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-20 10:10:08,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,247 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-20 10:10:08,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,263 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-20 10:10:08,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,278 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-20 10:10:08,278 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,314 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,389 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-20 10:10:08,389 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-20 10:10:10,440 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-20 10:10:10,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,534 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-20 10:10:10,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:10:11,015 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-20 10:10:11,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-01-20 10:10:24,619 WARN L181 SmtUtils]: Spent 13.49 s on a formula simplification that was a NOOP. DAG size: 106 [2019-01-20 10:10:24,626 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-20 10:10:24,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:24,682 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-20 10:10:24,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:24,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:24,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:24,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:24,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:24,703 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-01-20 10:10:55,907 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-20 10:10:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:55,908 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-20 10:10:55,912 INFO L168 Benchmark]: Toolchain (without parser) took 77976.56 ms. Allocated memory was 135.3 MB in the beginning and 382.2 MB in the end (delta: 246.9 MB). Free memory was 110.4 MB in the beginning and 249.3 MB in the end (delta: -138.9 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2019-01-20 10:10:55,913 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 135.3 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:10:55,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.20 ms. Allocated memory is still 135.3 MB. Free memory was 110.4 MB in the beginning and 108.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-20 10:10:55,914 INFO L168 Benchmark]: Boogie Preprocessor took 31.04 ms. Allocated memory is still 135.3 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:10:55,914 INFO L168 Benchmark]: RCFGBuilder took 435.66 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 95.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-01-20 10:10:55,914 INFO L168 Benchmark]: TraceAbstraction took 77445.03 ms. Allocated memory was 135.3 MB in the beginning and 382.2 MB in the end (delta: 246.9 MB). Free memory was 94.8 MB in the beginning and 249.3 MB in the end (delta: -154.5 MB). Peak memory consumption was 92.4 MB. Max. memory is 7.1 GB. [2019-01-20 10:10:55,917 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.19 ms. Allocated memory is still 135.3 MB. Free memory is still 111.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.20 ms. Allocated memory is still 135.3 MB. Free memory was 110.4 MB in the beginning and 108.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.04 ms. Allocated memory is still 135.3 MB. Free memory was 108.0 MB in the beginning and 106.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 435.66 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 95.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77445.03 ms. Allocated memory was 135.3 MB in the beginning and 382.2 MB in the end (delta: 246.9 MB). Free memory was 94.8 MB in the beginning and 249.3 MB in the end (delta: -154.5 MB). Peak memory consumption was 92.4 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...