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-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:04:26,965 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:04:26,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:04:26,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:04:26,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:04:26,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:04:26,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:04:26,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:04:26,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:04:26,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:04:26,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:04:26,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:04:26,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:04:26,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:04:26,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:04:26,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:04:26,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:04:27,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:04:27,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:04:27,005 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:04:27,009 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:04:27,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:04:27,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:04:27,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:04:27,016 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:04:27,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:04:27,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:04:27,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:04:27,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:04:27,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:04:27,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:04:27,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:04:27,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:04:27,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:04:27,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:04:27,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:04:27,023 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-08 14:04:27,040 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:04:27,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:04:27,041 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:04:27,041 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:04:27,041 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:04:27,042 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:04:27,042 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:04:27,042 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:04:27,042 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:04:27,042 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:04:27,043 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:04:27,043 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:04:27,043 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:04:27,043 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:04:27,044 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:04:27,044 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:04:27,044 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:04:27,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:04:27,045 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:04:27,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:04:27,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:04:27,045 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:04:27,045 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:04:27,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:04:27,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:04:27,046 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:04:27,046 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:04:27,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:04:27,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:04:27,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:04:27,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:04:27,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:27,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:04:27,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:04:27,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:04:27,048 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:04:27,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:04:27,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:04:27,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:04:27,049 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:04:27,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:04:27,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:04:27,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:04:27,110 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:04:27,110 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:04:27,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-08 14:04:27,111 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-08 14:04:27,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:04:27,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:04:27,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:27,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:04:27,153 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:04:27,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:27,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:04:27,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:04:27,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:04:27,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/1) ... [2019-01-08 14:04:27,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:04:27,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:04:27,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:04:27,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:04:27,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 14:04:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:04:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:04:27,683 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:04:27,683 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-08 14:04:27,685 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:27 BoogieIcfgContainer [2019-01-08 14:04:27,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:04:27,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:04:27,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:04:27,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:04:27,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:27" (1/2) ... [2019-01-08 14:04:27,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4f2787 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:04:27, skipping insertion in model container [2019-01-08 14:04:27,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:27" (2/2) ... [2019-01-08 14:04:27,693 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-08 14:04:27,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:04:27,713 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-08 14:04:27,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-08 14:04:27,767 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:04:27,767 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:04:27,767 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:04:27,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:04:27,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:04:27,768 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:04:27,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:04:27,769 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:04:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-08 14:04:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:04:27,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:27,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:04:27,799 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-08 14:04:27,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:27,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:27,994 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-08 14:04:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:27,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:27,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:28,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:28,018 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-08 14:04:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:28,349 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-08 14:04:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:28,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:04:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:28,367 INFO L225 Difference]: With dead ends: 25 [2019-01-08 14:04:28,367 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 14:04:28,370 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-08 14:04:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 14:04:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-08 14:04:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 14:04:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-08 14:04:28,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-08 14:04:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:28,411 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-08 14:04:28,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-08 14:04:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:28,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:28,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:28,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-08 14:04:28,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:28,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:28,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:28,588 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-08 14:04:28,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:28,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:28,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:28,591 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-08 14:04:28,626 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:28,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:28,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:28,707 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 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-08 14:04:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:28,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:28,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:28,714 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-08 14:04:28,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:28,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:28,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:28,817 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 18 treesize of output 21 [2019-01-08 14:04:28,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,831 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 21 treesize of output 27 [2019-01-08 14:04:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,886 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 23 treesize of output 37 [2019-01-08 14:04:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,908 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 25 treesize of output 51 [2019-01-08 14:04:28,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:28,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,029 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:29,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:29,461 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:29,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:29,595 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 36 treesize of output 66 [2019-01-08 14:04:29,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:29,672 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-08 14:04:29,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:29,740 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-08 14:04:29,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:29,803 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-08 14:04:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:29,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:29,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:29,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:29,827 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-08 14:04:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:30,603 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-08 14:04:30,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:30,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:30,605 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:04:30,605 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 14:04:30,607 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-08 14:04:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 14:04:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-08 14:04:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 14:04:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-08 14:04:30,613 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-08 14:04:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:30,614 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-08 14:04:30,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-08 14:04:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:30,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:30,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:30,615 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-08 14:04:30,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:30,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:30,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:30,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:30,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:30,738 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-08 14:04:30,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:30,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:30,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:30,739 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-08 14:04:30,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:30,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:30,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:30,750 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 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-08 14:04:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:30,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:30,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:30,751 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-08 14:04:30,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:30,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:30,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:30,781 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 18 treesize of output 21 [2019-01-08 14:04:30,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,789 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 21 treesize of output 27 [2019-01-08 14:04:30,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,797 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 23 treesize of output 37 [2019-01-08 14:04:30,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,810 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 25 treesize of output 51 [2019-01-08 14:04:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:30,832 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:30,834 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:30,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:30,991 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:31,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,075 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 36 treesize of output 72 [2019-01-08 14:04:31,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,149 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-08 14:04:31,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:31,172 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-08 14:04:31,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:31,188 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-08 14:04:31,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:31,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:04:31,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:31,210 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-08 14:04:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:31,349 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-08 14:04:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:31,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:04:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:31,352 INFO L225 Difference]: With dead ends: 18 [2019-01-08 14:04:31,352 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:04:31,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:04:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 14:04:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:04:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-08 14:04:31,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-08 14:04:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:31,358 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-08 14:04:31,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-08 14:04:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:31,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:31,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:31,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:31,360 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-08 14:04:31,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:31,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,488 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-08 14:04:31,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:31,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:31,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:31,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:31,490 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-08 14:04:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:31,546 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-08 14:04:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:31,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:04:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:31,547 INFO L225 Difference]: With dead ends: 21 [2019-01-08 14:04:31,547 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 14:04:31,547 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-08 14:04:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 14:04:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-08 14:04:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:04:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-08 14:04:31,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-08 14:04:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:31,552 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-08 14:04:31,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-08 14:04:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:31,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:31,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:31,553 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-08 14:04:31,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:31,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:31,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:31,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,684 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-08 14:04:31,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:31,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:31,685 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-08 14:04:31,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:31,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:31,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:31,694 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 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-08 14:04:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:31,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:31,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:31,695 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-08 14:04:31,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:31,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:31,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:31,731 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 18 treesize of output 21 [2019-01-08 14:04:31,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,736 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 21 treesize of output 27 [2019-01-08 14:04:31,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,747 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 23 treesize of output 37 [2019-01-08 14:04:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,772 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 25 treesize of output 51 [2019-01-08 14:04:31,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:31,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:31,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:31,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:32,035 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:32,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,080 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 36 treesize of output 72 [2019-01-08 14:04:32,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,130 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-08 14:04:32,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:32,172 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-08 14:04:32,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:32,184 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-08 14:04:32,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:32,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:32,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:32,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:32,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:32,205 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-08 14:04:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:32,455 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-08 14:04:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:32,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:32,459 INFO L225 Difference]: With dead ends: 39 [2019-01-08 14:04:32,460 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 14:04:32,460 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-08 14:04:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 14:04:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-08 14:04:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:04:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-08 14:04:32,467 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-08 14:04:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:32,468 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-08 14:04:32,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-08 14:04:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:32,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:32,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:32,469 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:32,469 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-08 14:04:32,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:32,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:32,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:32,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:32,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:32,588 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-08 14:04:32,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:32,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:32,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:32,589 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-08 14:04:32,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:32,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:32,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:32,600 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:32,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:32,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:32,601 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-08 14:04:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:32,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:32,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:32,642 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 18 treesize of output 21 [2019-01-08 14:04:32,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,647 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 21 treesize of output 27 [2019-01-08 14:04:32,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,658 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 23 treesize of output 37 [2019-01-08 14:04:32,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,669 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 25 treesize of output 51 [2019-01-08 14:04:32,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,748 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:32,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:32,840 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:32,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:32,943 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 36 treesize of output 66 [2019-01-08 14:04:32,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:32,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:32,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:33,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:33,145 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-08 14:04:33,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:04:33,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:33,199 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-08 14:04:33,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:04:33,228 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-08 14:04:33,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:33,269 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-08 14:04:33,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:33,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:33,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:33,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:33,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:33,289 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-08 14:04:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:33,862 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-08 14:04:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:33,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:33,865 INFO L225 Difference]: With dead ends: 49 [2019-01-08 14:04:33,865 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 14:04:33,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 14:04:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-08 14:04:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 14:04:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-08 14:04:33,872 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-08 14:04:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:33,872 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-08 14:04:33,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-08 14:04:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:33,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:33,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:33,873 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:33,874 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-08 14:04:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:33,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:33,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:34,012 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-08 14:04:34,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:34,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:34,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:34,013 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-08 14:04:34,014 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:34,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:34,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:34,024 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:34,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:34,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:34,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:34,024 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-08 14:04:34,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:34,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:34,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:34,046 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 18 treesize of output 21 [2019-01-08 14:04:34,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,056 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 21 treesize of output 27 [2019-01-08 14:04:34,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,070 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 23 treesize of output 37 [2019-01-08 14:04:34,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,085 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 25 treesize of output 51 [2019-01-08 14:04:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,099 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:34,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:34,201 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:34,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,306 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 36 treesize of output 66 [2019-01-08 14:04:34,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,356 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-08 14:04:34,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:34,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:34,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:04:34,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:34,565 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-08 14:04:34,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:04:34,580 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-08 14:04:34,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:34,607 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-08 14:04:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:34,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:34,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:34,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:34,629 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-08 14:04:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:35,701 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-08 14:04:35,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:35,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:35,703 INFO L225 Difference]: With dead ends: 47 [2019-01-08 14:04:35,703 INFO L226 Difference]: Without dead ends: 46 [2019-01-08 14:04:35,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-08 14:04:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-08 14:04:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 14:04:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-08 14:04:35,714 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-08 14:04:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:35,715 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-08 14:04:35,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-08 14:04:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:35,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:35,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:35,716 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-08 14:04:35,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:35,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,800 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-08 14:04:35,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:35,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:35,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:35,801 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-08 14:04:35,803 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:35,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:35,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:35,814 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:35,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:35,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:35,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:35,815 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-08 14:04:35,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:35,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:35,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:35,836 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 18 treesize of output 21 [2019-01-08 14:04:35,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-08 14:04:35,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:04:35,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:04:35,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:35,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:04:35,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:35,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:36,052 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:04:36,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:36,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:36,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:36,204 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-08 14:04:36,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:36,215 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-08 14:04:36,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:36,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:04:36,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:36,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:36,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:36,237 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-08 14:04:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:36,302 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-08 14:04:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:36,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:04:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:36,303 INFO L225 Difference]: With dead ends: 28 [2019-01-08 14:04:36,303 INFO L226 Difference]: Without dead ends: 27 [2019-01-08 14:04:36,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-08 14:04:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-08 14:04:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:04:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-08 14:04:36,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-08 14:04:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:36,313 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-08 14:04:36,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-08 14:04:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:36,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:36,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:36,315 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-08 14:04:36,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:36,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:36,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:36,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:36,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:36,499 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:04:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:36,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:36,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:36,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:36,530 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-08 14:04:36,532 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:36,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:36,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:36,538 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:36,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:36,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:36,539 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-08 14:04:36,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:36,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:36,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:36,562 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 18 treesize of output 21 [2019-01-08 14:04:36,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,570 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 21 treesize of output 27 [2019-01-08 14:04:36,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,580 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 23 treesize of output 37 [2019-01-08 14:04:36,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,591 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 25 treesize of output 51 [2019-01-08 14:04:36,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,605 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:36,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,644 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:36,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:36,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,763 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 36 treesize of output 66 [2019-01-08 14:04:36,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:36,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:36,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:36,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:36,918 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 38 treesize of output 81 [2019-01-08 14:04:36,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:36,971 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-08 14:04:36,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:04:37,000 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-08 14:04:37,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:37,030 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-08 14:04:37,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:37,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:37,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:37,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:37,052 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-08 14:04:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:37,515 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-08 14:04:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:37,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:37,517 INFO L225 Difference]: With dead ends: 44 [2019-01-08 14:04:37,517 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 14:04:37,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 14:04:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-08 14:04:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 14:04:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-08 14:04:37,525 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-08 14:04:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:37,526 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-08 14:04:37,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-08 14:04:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:37,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:37,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:37,527 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:37,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:37,527 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-08 14:04:37,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:37,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:37,594 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-08 14:04:37,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:37,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:37,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:37,595 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-08 14:04:37,596 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:37,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:37,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:37,602 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:37,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:37,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:37,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:37,603 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-08 14:04:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:37,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:37,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:37,638 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 18 treesize of output 21 [2019-01-08 14:04:37,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:04:37,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:04:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:04:37,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:04:37,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:37,828 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:04:37,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:37,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:04:37,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:37,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:37,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:37,905 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-08 14:04:37,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:37,926 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-08 14:04:37,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:37,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:37,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:37,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:37,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:37,949 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-08 14:04:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:38,230 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-08 14:04:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:38,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:38,232 INFO L225 Difference]: With dead ends: 43 [2019-01-08 14:04:38,232 INFO L226 Difference]: Without dead ends: 42 [2019-01-08 14:04:38,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-08 14:04:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-08 14:04:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-08 14:04:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:04:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-08 14:04:38,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-08 14:04:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:38,242 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-08 14:04:38,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-08 14:04:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:38,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:38,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:38,243 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-08 14:04:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:38,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:38,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:38,410 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-08 14:04:38,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:38,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:38,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:38,411 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-08 14:04:38,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:38,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:38,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:38,418 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:38,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:38,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:38,419 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-08 14:04:38,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:38,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:38,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:38,444 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 18 treesize of output 21 [2019-01-08 14:04:38,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,449 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 21 treesize of output 27 [2019-01-08 14:04:38,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,465 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 23 treesize of output 37 [2019-01-08 14:04:38,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-08 14:04:38,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,504 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:38,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,535 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:38,599 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:38,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,640 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 36 treesize of output 72 [2019-01-08 14:04:38,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:38,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:38,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:38,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:04:38,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:38,839 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-08 14:04:38,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:38,865 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-08 14:04:38,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:38,888 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-08 14:04:38,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:38,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:38,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:38,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:38,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:38,909 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-08 14:04:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:39,334 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-08 14:04:39,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:39,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:39,335 INFO L225 Difference]: With dead ends: 56 [2019-01-08 14:04:39,336 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:04:39,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:04:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-08 14:04:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 14:04:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-08 14:04:39,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-08 14:04:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:39,345 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-08 14:04:39,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-08 14:04:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:39,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:39,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:39,346 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:39,347 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-08 14:04:39,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:39,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:39,524 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-08 14:04:39,548 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-08 14:04:39,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:39,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:39,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:39,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:39,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:39,549 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-08 14:04:39,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:39,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:39,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:04:39,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:39,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:39,570 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 18 treesize of output 21 [2019-01-08 14:04:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,573 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 21 treesize of output 27 [2019-01-08 14:04:39,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,581 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 23 treesize of output 37 [2019-01-08 14:04:39,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,594 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 25 treesize of output 51 [2019-01-08 14:04:39,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,603 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:39,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:39,701 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:39,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,741 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 36 treesize of output 72 [2019-01-08 14:04:39,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:39,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:39,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:39,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:04:39,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:39,977 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-08 14:04:39,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:39,995 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-08 14:04:39,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:40,054 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-08 14:04:40,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:40,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:40,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:40,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:40,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:40,081 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-08 14:04:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:40,449 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-08 14:04:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:40,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:40,451 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:04:40,451 INFO L226 Difference]: Without dead ends: 64 [2019-01-08 14:04:40,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-08 14:04:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-08 14:04:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:04:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-08 14:04:40,460 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-08 14:04:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:40,461 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-08 14:04:40,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-08 14:04:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:40,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:40,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:40,462 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-08 14:04:40,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:40,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:40,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:40,542 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-08 14:04:40,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:40,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:40,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:40,543 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-08 14:04:40,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:40,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:40,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:40,551 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:40,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:40,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:40,552 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-08 14:04:40,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:40,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:40,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:40,600 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 18 treesize of output 21 [2019-01-08 14:04:40,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,607 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 21 treesize of output 27 [2019-01-08 14:04:40,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,623 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 23 treesize of output 37 [2019-01-08 14:04:40,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,634 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 25 treesize of output 51 [2019-01-08 14:04:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,649 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:40,650 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:40,741 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:40,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:40,795 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 36 treesize of output 72 [2019-01-08 14:04:40,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:40,839 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-08 14:04:40,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:40,855 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-08 14:04:40,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:40,866 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-08 14:04:40,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:40,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:40,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:40,888 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-08 14:04:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:41,108 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-08 14:04:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:41,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:41,109 INFO L225 Difference]: With dead ends: 45 [2019-01-08 14:04:41,109 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 14:04:41,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-08 14:04:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 14:04:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-08 14:04:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 14:04:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-08 14:04:41,118 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-08 14:04:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:41,118 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-08 14:04:41,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-08 14:04:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:41,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:41,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:41,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-08 14:04:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,153 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-08 14:04:41,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:41,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:41,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:41,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:41,154 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-08 14:04:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:41,186 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-08 14:04:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:41,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 14:04:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:41,187 INFO L225 Difference]: With dead ends: 34 [2019-01-08 14:04:41,188 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:04:41,188 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-08 14:04:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:04:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-08 14:04:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:04:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-08 14:04:41,197 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-08 14:04:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:41,197 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-08 14:04:41,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-08 14:04:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:41,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:41,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:41,198 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-08 14:04:41,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,337 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-08 14:04:41,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:41,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:41,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:41,337 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-08 14:04:41,338 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:41,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:41,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:41,344 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:41,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:41,345 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:41,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:41,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:41,379 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 18 treesize of output 21 [2019-01-08 14:04:41,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,386 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 21 treesize of output 27 [2019-01-08 14:04:41,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,391 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 23 treesize of output 37 [2019-01-08 14:04:41,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,401 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 25 treesize of output 51 [2019-01-08 14:04:41,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,417 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:41,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,444 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:41,500 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:41,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,545 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 36 treesize of output 72 [2019-01-08 14:04:41,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,601 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-08 14:04:41,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:41,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:41,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:04:41,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:41,701 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-08 14:04:41,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:04:41,716 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-08 14:04:41,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:41,735 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-08 14:04:41,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:41,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:04:41,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:41,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:04:41,755 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-08 14:04:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:42,142 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-08 14:04:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:42,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:42,144 INFO L225 Difference]: With dead ends: 59 [2019-01-08 14:04:42,144 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:04:42,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:04:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-08 14:04:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-08 14:04:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-08 14:04:42,154 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-08 14:04:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:42,154 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-08 14:04:42,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-08 14:04:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:42,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:42,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:42,155 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-08 14:04:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:42,226 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-08 14:04:42,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:42,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:42,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:42,228 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-08 14:04:42,229 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:42,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:42,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:42,239 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:42,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:42,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:42,239 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:42,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:42,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:42,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:42,271 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 18 treesize of output 21 [2019-01-08 14:04:42,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:04:42,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:04:42,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:04:42,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:04:42,316 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:42,389 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:04:42,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:42,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:04:42,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:42,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:42,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:42,468 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-08 14:04:42,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:42,479 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-08 14:04:42,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:42,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:42,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:42,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:42,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:42,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:42,500 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-08 14:04:42,942 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-08 14:04:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:43,477 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-08 14:04:43,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:43,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:04:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:43,478 INFO L225 Difference]: With dead ends: 51 [2019-01-08 14:04:43,479 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 14:04:43,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:43,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 14:04:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-08 14:04:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:04:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-08 14:04:43,490 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-08 14:04:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:43,490 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-08 14:04:43,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-08 14:04:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:43,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:43,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:43,491 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-08 14:04:43,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:43,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,578 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-08 14:04:43,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:43,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:43,579 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-08 14:04:43,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:43,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:43,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:43,585 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 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-08 14:04:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:43,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,586 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:43,607 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 18 treesize of output 21 [2019-01-08 14:04:43,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,612 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 21 treesize of output 27 [2019-01-08 14:04:43,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,626 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 23 treesize of output 37 [2019-01-08 14:04:43,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,638 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 25 treesize of output 51 [2019-01-08 14:04:43,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,645 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:43,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:43,729 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:43,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,799 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 36 treesize of output 72 [2019-01-08 14:04:43,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:43,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:43,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:04:43,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,959 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-08 14:04:43,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:43,988 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-08 14:04:43,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:44,009 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-08 14:04:44,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:44,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:44,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:44,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:44,029 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-08 14:04:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:44,556 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-08 14:04:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:44,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:44,557 INFO L225 Difference]: With dead ends: 64 [2019-01-08 14:04:44,557 INFO L226 Difference]: Without dead ends: 63 [2019-01-08 14:04:44,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-08 14:04:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-08 14:04:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:04:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-08 14:04:44,569 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-08 14:04:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:44,569 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-08 14:04:44,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-08 14:04:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:44,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:44,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:44,571 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-08 14:04:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:44,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:44,676 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-08 14:04:44,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:44,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:44,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:44,676 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-08 14:04:44,677 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:44,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:44,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:44,683 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:44,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:44,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:44,683 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:44,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:44,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:44,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:44,706 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 18 treesize of output 21 [2019-01-08 14:04:44,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:04:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:04:44,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:04:44,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:04:44,762 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:44,841 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:04:44,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:44,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:44,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:44,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:04:45,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:45,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:04:45,050 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-08 14:04:45,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:45,088 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-08 14:04:45,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:45,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:45,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:45,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:45,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:45,108 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-08 14:04:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:45,450 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-08 14:04:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:45,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:45,452 INFO L225 Difference]: With dead ends: 57 [2019-01-08 14:04:45,452 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 14:04:45,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 14:04:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-08 14:04:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:04:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-08 14:04:45,464 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-08 14:04:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:45,464 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-08 14:04:45,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-08 14:04:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:45,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:45,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:45,465 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-08 14:04:45,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:45,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:45,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:45,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:45,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:45,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:45,632 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-08 14:04:45,634 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:45,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:45,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:45,639 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:45,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:45,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:45,640 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:45,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:45,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:45,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:45,678 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 18 treesize of output 21 [2019-01-08 14:04:45,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,704 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 21 treesize of output 27 [2019-01-08 14:04:45,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,710 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 23 treesize of output 37 [2019-01-08 14:04:45,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,789 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 25 treesize of output 51 [2019-01-08 14:04:45,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:45,889 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:45,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,169 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:46,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,236 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 36 treesize of output 66 [2019-01-08 14:04:46,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:46,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:04:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:46,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:04:46,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,465 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:46,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:04:46,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,525 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-08 14:04:46,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:04:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:46,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:46,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:46,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:46,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:46,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:46,643 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-08 14:04:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:47,675 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-08 14:04:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:47,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:47,677 INFO L225 Difference]: With dead ends: 68 [2019-01-08 14:04:47,677 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:04:47,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:04:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:04:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-08 14:04:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:04:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-08 14:04:47,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-08 14:04:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:47,691 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-08 14:04:47,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-08 14:04:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:47,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:47,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:47,692 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-08 14:04:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,909 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:04:47,938 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-08 14:04:47,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:47,939 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:47,940 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-08 14:04:47,941 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:47,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:47,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:47,945 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:47,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,946 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:47,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:47,965 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 18 treesize of output 21 [2019-01-08 14:04:47,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,971 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 21 treesize of output 27 [2019-01-08 14:04:47,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,978 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 23 treesize of output 37 [2019-01-08 14:04:47,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,990 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 25 treesize of output 51 [2019-01-08 14:04:47,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,999 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:47,999 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:48,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,138 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 36 treesize of output 66 [2019-01-08 14:04:48,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:48,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:04:48,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,271 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-08 14:04:48,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:04:48,291 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-08 14:04:48,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:48,311 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-08 14:04:48,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:48,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:48,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:48,332 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-08 14:04:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:48,693 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-08 14:04:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:48,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:48,694 INFO L225 Difference]: With dead ends: 56 [2019-01-08 14:04:48,694 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:04:48,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:04:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-08 14:04:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:04:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-08 14:04:48,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-08 14:04:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:48,705 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-08 14:04:48,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-08 14:04:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:48,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:48,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:48,707 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-08 14:04:48,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:48,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:48,741 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-08 14:04:48,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:48,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:48,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:48,741 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-08 14:04:48,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:48,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:48,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:48,748 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:48,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:48,748 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:48,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:48,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:48,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:48,790 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 18 treesize of output 21 [2019-01-08 14:04:48,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:04:48,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:04:48,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:04:48,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:04:48,850 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,909 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-08 14:04:48,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,942 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:04:48,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:04:48,972 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-08 14:04:48,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:48,983 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-08 14:04:49,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:49,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:49,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:49,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:49,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:49,003 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-08 14:04:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:49,130 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-08 14:04:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:49,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-08 14:04:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:49,131 INFO L225 Difference]: With dead ends: 45 [2019-01-08 14:04:49,131 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 14:04:49,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 14:04:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-08 14:04:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:04:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-08 14:04:49,141 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-08 14:04:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:49,141 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-08 14:04:49,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-08 14:04:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:49,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:49,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:49,143 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-08 14:04:49,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:49,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:49,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:49,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:49,387 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:04:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:49,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:49,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:49,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:49,420 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-08 14:04:49,421 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:49,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:49,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:49,425 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:49,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:49,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:49,426 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:49,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:49,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:49,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:49,447 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 18 treesize of output 21 [2019-01-08 14:04:49,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,452 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 21 treesize of output 27 [2019-01-08 14:04:49,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,458 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 23 treesize of output 37 [2019-01-08 14:04:49,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,468 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 25 treesize of output 51 [2019-01-08 14:04:49,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:49,477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:49,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:49,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:49,927 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:50,092 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-08 14:04:50,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,117 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 36 treesize of output 66 [2019-01-08 14:04:50,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:50,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:50,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,320 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:50,321 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 38 treesize of output 81 [2019-01-08 14:04:50,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,443 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-08 14:04:50,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:04:50,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-08 14:04:50,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,554 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-08 14:04:50,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:04:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:50,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:50,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:50,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:04:50,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:50,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:50,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:50,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:50,633 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-08 14:04:51,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:51,236 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-08 14:04:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:51,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:51,239 INFO L225 Difference]: With dead ends: 71 [2019-01-08 14:04:51,240 INFO L226 Difference]: Without dead ends: 70 [2019-01-08 14:04:51,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:04:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-08 14:04:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-08 14:04:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 14:04:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-08 14:04:51,264 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-08 14:04:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:51,264 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-08 14:04:51,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-08 14:04:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:51,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:51,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:51,265 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-08 14:04:51,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:51,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:51,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:51,391 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-08 14:04:51,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:51,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:51,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:51,392 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-08 14:04:51,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:51,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:51,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:51,396 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:51,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:51,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:51,397 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:51,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:51,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:51,419 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 18 treesize of output 21 [2019-01-08 14:04:51,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:04:51,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:04:51,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:04:51,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:04:51,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,561 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:04:51,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:04:51,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:51,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:04:51,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:04:51,787 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-08 14:04:51,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:51,819 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-08 14:04:51,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:51,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:51,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:51,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:51,839 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-08 14:04:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:52,124 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-08 14:04:52,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:52,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:52,125 INFO L225 Difference]: With dead ends: 59 [2019-01-08 14:04:52,125 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:04:52,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:04:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-08 14:04:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:04:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-08 14:04:52,137 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-08 14:04:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:52,138 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-08 14:04:52,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-08 14:04:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:52,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:52,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:52,139 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-08 14:04:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:52,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:52,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:52,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:52,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:52,432 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-08 14:04:52,432 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:52,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:52,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:52,436 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:52,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:52,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:52,437 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:52,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:52,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:52,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:52,487 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 18 treesize of output 21 [2019-01-08 14:04:52,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,530 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 21 treesize of output 27 [2019-01-08 14:04:52,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,591 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 23 treesize of output 37 [2019-01-08 14:04:52,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,673 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 25 treesize of output 51 [2019-01-08 14:04:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,697 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:52,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:52,780 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:52,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,819 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 36 treesize of output 66 [2019-01-08 14:04:52,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:52,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:52,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:04:52,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:52,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:04:53,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,136 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:04:53,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,217 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-08 14:04:53,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:04:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:53,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:53,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:53,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:53,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:53,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:53,309 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-08 14:04:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:54,081 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-08 14:04:54,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:54,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:54,082 INFO L225 Difference]: With dead ends: 71 [2019-01-08 14:04:54,083 INFO L226 Difference]: Without dead ends: 70 [2019-01-08 14:04:54,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:04:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-08 14:04:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-08 14:04:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:04:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-08 14:04:54,092 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-08 14:04:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:54,092 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-08 14:04:54,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-08 14:04:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:54,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:54,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:54,093 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-08 14:04:54,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:54,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:54,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:04:54,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:54,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:54,193 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:54,193 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-08 14:04:54,194 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:54,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:54,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:54,197 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:54,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:54,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:54,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:54,198 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:54,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:54,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:54,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:54,230 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 18 treesize of output 21 [2019-01-08 14:04:54,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,233 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 21 treesize of output 27 [2019-01-08 14:04:54,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,238 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 23 treesize of output 37 [2019-01-08 14:04:54,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,245 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 25 treesize of output 51 [2019-01-08 14:04:54,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,254 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:54,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:54,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:54,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,369 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 36 treesize of output 72 [2019-01-08 14:04:54,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:54,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:54,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:54,604 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-08 14:04:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:54,921 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:54,922 INFO L303 Elim1Store]: Index analysis took 314 ms [2019-01-08 14:04:54,922 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 36 treesize of output 80 [2019-01-08 14:04:54,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:55,466 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-08 14:04:55,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:55,618 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-08 14:04:55,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:55,644 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-08 14:04:55,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:55,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:55,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:55,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:55,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:55,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:55,665 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-08 14:04:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:56,029 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-08 14:04:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:56,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:56,031 INFO L225 Difference]: With dead ends: 66 [2019-01-08 14:04:56,031 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:04:56,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:04:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-08 14:04:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:04:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-08 14:04:56,047 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-08 14:04:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-08 14:04:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-08 14:04:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:56,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:56,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:56,049 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-08 14:04:56,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,200 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-01-08 14:04:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:56,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:56,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:56,272 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-08 14:04:56,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:56,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:56,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:56,277 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:04:56,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:56,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,278 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:56,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:56,316 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 18 treesize of output 21 [2019-01-08 14:04:56,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,324 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 21 treesize of output 27 [2019-01-08 14:04:56,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,330 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 23 treesize of output 37 [2019-01-08 14:04:56,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,341 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 25 treesize of output 51 [2019-01-08 14:04:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,359 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:04:56,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:56,485 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:04:56,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,542 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 36 treesize of output 72 [2019-01-08 14:04:56,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:56,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:56,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,661 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:56,661 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 36 treesize of output 80 [2019-01-08 14:04:56,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:56,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:56,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:04:56,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,846 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-08 14:04:56,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:04:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:56,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:56,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:56,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:04:56,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:56,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:04:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:04:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:04:56,924 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-08 14:04:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:57,567 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-08 14:04:57,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:04:57,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:04:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:57,568 INFO L225 Difference]: With dead ends: 93 [2019-01-08 14:04:57,569 INFO L226 Difference]: Without dead ends: 92 [2019-01-08 14:04:57,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:04:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-08 14:04:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-08 14:04:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-08 14:04:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-08 14:04:57,581 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-08 14:04:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:57,582 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-08 14:04:57,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:04:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-08 14:04:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:57,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:57,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:57,583 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-08 14:04:57,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:57,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:57,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:57,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:57,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:57,851 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:04:57,856 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-08 14:04:57,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:57,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:57,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:57,857 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-08 14:04:57,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:57,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:57,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:57,861 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:57,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:57,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:57,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:57,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:57,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:57,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:57,883 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 18 treesize of output 21 [2019-01-08 14:04:57,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, 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 23 [2019-01-08 14:04:57,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:04:57,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:04:57,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:04:57,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:58,001 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-08 14:04:58,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,027 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:04:58,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:58,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:04:58,056 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-08 14:04:58,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:58,064 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-08 14:04:58,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:58,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:04:58,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:58,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:58,083 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-08 14:04:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:58,126 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-08 14:04:58,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:58,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:04:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:58,128 INFO L225 Difference]: With dead ends: 56 [2019-01-08 14:04:58,128 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:04:58,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:04:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-08 14:04:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 14:04:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-08 14:04:58,143 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-08 14:04:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:58,144 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-08 14:04:58,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-08 14:04:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:58,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:58,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:58,144 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-08 14:04:58,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:58,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:58,204 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-08 14:04:58,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:58,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:58,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:04:58,205 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-08 14:04:58,206 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:58,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:58,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:58,209 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:04:58,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:58,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:58,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:58,210 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:58,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:58,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:58,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:58,228 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 18 treesize of output 21 [2019-01-08 14:04:58,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:04:58,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:04:58,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:04:58,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:58,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:04:58,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,311 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:58,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:58,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:04:59,335 WARN L181 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-08 14:04:59,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:04:59,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:59,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:59,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:04:59,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:59,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:59,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:04:59,472 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-08 14:04:59,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:59,490 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-08 14:04:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:59,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:59,509 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-08 14:04:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:59,835 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-08 14:04:59,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:04:59,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:04:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:59,837 INFO L225 Difference]: With dead ends: 85 [2019-01-08 14:04:59,837 INFO L226 Difference]: Without dead ends: 84 [2019-01-08 14:04:59,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:04:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-08 14:04:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-08 14:04:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-08 14:04:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-08 14:04:59,857 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-08 14:04:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:59,857 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-08 14:04:59,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-08 14:04:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:04:59,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:59,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:04:59,857 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-08 14:04:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:59,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:59,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:00,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:00,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:00,012 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-08 14:05:00,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:00,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:00,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:00,016 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:00,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,016 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:00,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:00,033 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 18 treesize of output 21 [2019-01-08 14:05:00,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,037 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 21 treesize of output 27 [2019-01-08 14:05:00,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,044 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 23 treesize of output 37 [2019-01-08 14:05:00,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,052 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 25 treesize of output 51 [2019-01-08 14:05:00,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,063 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:00,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:00,143 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:00,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,178 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 36 treesize of output 72 [2019-01-08 14:05:00,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:00,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:00,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:00,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:00,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:00,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:05:00,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,443 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-08 14:05:00,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:00,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:00,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:00,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:00,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:00,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:00,535 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-08 14:05:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:01,285 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-08 14:05:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:01,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:01,287 INFO L225 Difference]: With dead ends: 96 [2019-01-08 14:05:01,287 INFO L226 Difference]: Without dead ends: 94 [2019-01-08 14:05:01,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-08 14:05:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-08 14:05:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:05:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-08 14:05:01,305 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-08 14:05:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:01,306 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-08 14:05:01,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-08 14:05:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:01,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:01,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:01,307 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-08 14:05:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:01,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:01,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:01,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:01,452 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-08 14:05:01,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:01,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:01,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:01,453 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-08 14:05:01,454 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:01,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:01,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:01,457 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:05:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:01,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:01,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:01,458 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:01,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:01,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:01,477 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 18 treesize of output 21 [2019-01-08 14:05:01,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:01,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:01,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:01,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:01,665 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:01,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:01,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:01,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:01,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:01,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:05:01,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:01,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:01,950 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-08 14:05:01,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:01,970 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-08 14:05:01,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:01,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:01,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:01,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:01,991 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-08 14:05:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:02,311 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-08 14:05:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:02,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:02,312 INFO L225 Difference]: With dead ends: 82 [2019-01-08 14:05:02,312 INFO L226 Difference]: Without dead ends: 81 [2019-01-08 14:05:02,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-08 14:05:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-08 14:05:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:05:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-08 14:05:02,334 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-08 14:05:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:02,334 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-08 14:05:02,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-08 14:05:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:02,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:02,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:02,335 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:02,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-08 14:05:02,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:02,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:02,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:02,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:02,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:02,505 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:05:02,523 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-08 14:05:02,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:02,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:02,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:02,524 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-08 14:05:02,525 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:02,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:02,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:02,528 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:05:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:02,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:02,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:02,529 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:02,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:02,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:02,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:02,548 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 18 treesize of output 21 [2019-01-08 14:05:02,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,551 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 21 treesize of output 27 [2019-01-08 14:05:02,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,556 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 23 treesize of output 37 [2019-01-08 14:05:02,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,562 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 25 treesize of output 51 [2019-01-08 14:05:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,570 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:02,571 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:02,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:02,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,693 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 36 treesize of output 72 [2019-01-08 14:05:02,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,737 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-08 14:05:02,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:02,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:02,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:02,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:02,983 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-08 14:05:02,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:03,000 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-08 14:05:03,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:03,011 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-08 14:05:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:03,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:03,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:03,031 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-08 14:05:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:03,339 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-08 14:05:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:03,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:03,341 INFO L225 Difference]: With dead ends: 87 [2019-01-08 14:05:03,341 INFO L226 Difference]: Without dead ends: 86 [2019-01-08 14:05:03,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-08 14:05:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-08 14:05:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 14:05:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-08 14:05:03,362 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-08 14:05:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:03,362 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-08 14:05:03,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-08 14:05:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:03,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:03,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:03,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-08 14:05:03,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:03,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:03,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:03,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:03,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:03,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:03,464 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-08 14:05:03,464 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:03,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:03,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:03,467 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:05:03,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:03,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:03,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:03,468 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:03,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:03,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:03,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:03,490 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 18 treesize of output 21 [2019-01-08 14:05:03,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,494 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 21 treesize of output 27 [2019-01-08 14:05:03,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,502 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 23 treesize of output 37 [2019-01-08 14:05:03,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,512 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 25 treesize of output 51 [2019-01-08 14:05:03,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,522 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:03,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,550 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:03,629 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:03,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,664 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 36 treesize of output 72 [2019-01-08 14:05:03,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:03,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:03,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:03,743 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:03,743 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 36 treesize of output 80 [2019-01-08 14:05:03,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:03,789 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-08 14:05:03,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:03,809 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-08 14:05:03,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:03,833 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-08 14:05:03,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:03,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:03,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:03,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:03,854 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-08 14:05:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:04,184 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-08 14:05:04,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:04,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:04,186 INFO L225 Difference]: With dead ends: 86 [2019-01-08 14:05:04,186 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:05:04,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:05:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-08 14:05:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-08 14:05:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-08 14:05:04,211 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-08 14:05:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:04,211 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-08 14:05:04,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-08 14:05:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:04,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:04,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:04,212 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-08 14:05:04,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:04,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:04,495 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-08 14:05:04,761 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:05:04,767 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-08 14:05:04,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:04,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:04,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:04,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:04,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:04,767 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:04,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:04,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:04,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:05:04,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:04,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:04,788 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 18 treesize of output 21 [2019-01-08 14:05:04,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:04,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:04,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:04,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:04,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,913 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:04,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:04,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:04,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:05,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:05:05,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:05,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:05,047 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-08 14:05:05,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:05,110 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-08 14:05:05,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:05,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:05,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:05,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:05,130 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-08 14:05:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:06,131 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-08 14:05:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:06,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:06,132 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:05:06,132 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:05:06,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-08 14:05:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:05:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-08 14:05:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 14:05:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-08 14:05:06,167 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-08 14:05:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:06,168 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-08 14:05:06,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-08 14:05:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:06,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:06,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:06,169 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-08 14:05:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:06,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:06,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:06,474 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-08 14:05:06,578 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-08 14:05:06,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:06,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:06,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:06,579 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-08 14:05:06,579 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:06,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:06,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:06,583 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:05:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:06,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:06,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:06,584 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:06,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:06,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:06,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:06,603 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 18 treesize of output 21 [2019-01-08 14:05:06,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:06,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:06,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:06,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:06,652 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:06,744 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:06,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:06,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:06,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:06,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:06,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:06,846 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-08 14:05:06,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:06,875 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-08 14:05:06,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:06,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:05:06,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:06,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:05:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:05:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:05:06,894 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-08 14:05:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:07,198 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-08 14:05:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:05:07,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-08 14:05:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:07,200 INFO L225 Difference]: With dead ends: 87 [2019-01-08 14:05:07,200 INFO L226 Difference]: Without dead ends: 86 [2019-01-08 14:05:07,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:05:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-08 14:05:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-08 14:05:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-08 14:05:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-08 14:05:07,221 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-08 14:05:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:07,221 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-08 14:05:07,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:05:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-08 14:05:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:07,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:07,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:07,222 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:07,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-08 14:05:07,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,404 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:05:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:07,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:07,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:07,443 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-08 14:05:07,444 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:07,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:07,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:07,447 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:07,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,448 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:07,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:07,465 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 18 treesize of output 21 [2019-01-08 14:05:07,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,467 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 21 treesize of output 27 [2019-01-08 14:05:07,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,472 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 23 treesize of output 37 [2019-01-08 14:05:07,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,479 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 25 treesize of output 51 [2019-01-08 14:05:07,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,488 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:07,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:07,568 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:07,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,602 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 36 treesize of output 72 [2019-01-08 14:05:07,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:07,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:07,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,678 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:07,679 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 36 treesize of output 80 [2019-01-08 14:05:07,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:07,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:07,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:07,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,805 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-08 14:05:07,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:07,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:07,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:07,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:07,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:07,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:07,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:07,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:07,881 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-08 14:05:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:08,428 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-08 14:05:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:08,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:05:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:08,430 INFO L225 Difference]: With dead ends: 133 [2019-01-08 14:05:08,430 INFO L226 Difference]: Without dead ends: 132 [2019-01-08 14:05:08,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-08 14:05:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-08 14:05:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:05:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-08 14:05:08,451 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-08 14:05:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:08,451 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-08 14:05:08,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-08 14:05:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:05:08,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:08,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:05:08,452 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-08 14:05:08,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:08,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:08,698 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:05:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:08,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:08,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:08,707 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:05:08,707 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-08 14:05:08,708 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:08,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:08,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:08,711 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 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-08 14:05:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:08,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:08,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:08,712 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:08,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:08,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:08,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:08,730 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 18 treesize of output 21 [2019-01-08 14:05:08,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:08,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:08,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:08,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:08,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:08,829 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:08,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:08,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:08,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:08,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:08,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:05:08,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:08,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:08,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:08,965 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-08 14:05:08,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:08,983 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-08 14:05:09,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:09,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:09,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:09,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:09,003 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-08 14:05:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:09,346 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-08 14:05:09,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:09,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:05:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:09,348 INFO L225 Difference]: With dead ends: 113 [2019-01-08 14:05:09,349 INFO L226 Difference]: Without dead ends: 112 [2019-01-08 14:05:09,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-08 14:05:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-08 14:05:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:05:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-08 14:05:09,378 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-08 14:05:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:09,378 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-08 14:05:09,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-08 14:05:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:09,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:09,379 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:05:09,379 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:09,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-08 14:05:09,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:09,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:09,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:09,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:09,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:09,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:09,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:09,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:09,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:09,497 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:09,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:09,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:09,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:09,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:09,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:09,515 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 18 treesize of output 21 [2019-01-08 14:05:09,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,518 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 21 treesize of output 27 [2019-01-08 14:05:09,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,524 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 23 treesize of output 37 [2019-01-08 14:05:09,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,533 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 25 treesize of output 51 [2019-01-08 14:05:09,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,578 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:09,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:09,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,696 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 36 treesize of output 66 [2019-01-08 14:05:09,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:09,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:09,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-08 14:05:09,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:09,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:09,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:09,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:09,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-08 14:05:09,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,025 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-08 14:05:10,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:10,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:10,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:10,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:05:10,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:10,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:05:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:05:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:10,122 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-08 14:05:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:10,883 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-08 14:05:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:10,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:05:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:10,886 INFO L225 Difference]: With dead ends: 136 [2019-01-08 14:05:10,886 INFO L226 Difference]: Without dead ends: 131 [2019-01-08 14:05:10,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:05:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-08 14:05:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-08 14:05:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:05:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-08 14:05:10,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-08 14:05:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:10,919 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-08 14:05:10,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:05:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-08 14:05:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:10,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:10,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:10,920 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-08 14:05:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:10,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:10,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:11,124 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:05:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:11,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:11,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:11,192 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:11,192 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-08 14:05:11,193 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:11,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:11,197 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:11,197 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:11,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:11,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:11,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:11,197 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:11,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:11,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:11,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:11,217 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 18 treesize of output 21 [2019-01-08 14:05:11,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,219 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 21 treesize of output 27 [2019-01-08 14:05:11,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,227 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 23 treesize of output 37 [2019-01-08 14:05:11,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,240 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 25 treesize of output 51 [2019-01-08 14:05:11,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,286 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:11,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:11,370 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:11,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,405 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 36 treesize of output 66 [2019-01-08 14:05:11,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:11,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:11,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:11,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:11,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:11,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:11,567 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:11,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:05:11,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:11,618 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-08 14:05:11,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:11,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:11,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:11,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:11,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:11,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:11,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:11,737 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-08 14:05:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:12,279 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-08 14:05:12,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:12,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:12,281 INFO L225 Difference]: With dead ends: 106 [2019-01-08 14:05:12,282 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:05:12,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:05:12,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-08 14:05:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:05:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-08 14:05:12,305 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-08 14:05:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:12,305 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-08 14:05:12,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-08 14:05:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:12,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:12,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:12,306 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-08 14:05:12,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:12,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:12,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:12,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:12,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:12,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:12,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:12,486 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-08 14:05:12,489 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:12,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:12,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:12,492 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:12,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:12,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:12,493 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:12,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:12,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:12,516 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 18 treesize of output 21 [2019-01-08 14:05:12,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,523 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 21 treesize of output 27 [2019-01-08 14:05:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,529 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 23 treesize of output 37 [2019-01-08 14:05:12,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,537 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 25 treesize of output 51 [2019-01-08 14:05:12,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,551 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:12,552 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:12,639 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:12,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,676 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 36 treesize of output 66 [2019-01-08 14:05:12,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:12,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:12,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:12,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:12,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:12,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,879 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:12,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:05:12,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:12,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:12,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,991 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:12,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:05:12,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:13,051 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-08 14:05:13,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:13,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:13,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:13,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:13,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:13,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:13,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:13,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:13,168 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-08 14:05:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:13,935 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-08 14:05:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:13,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:13,937 INFO L225 Difference]: With dead ends: 131 [2019-01-08 14:05:13,938 INFO L226 Difference]: Without dead ends: 130 [2019-01-08 14:05:13,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-08 14:05:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-08 14:05:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:05:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-08 14:05:13,963 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-08 14:05:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:13,963 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-08 14:05:13,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-08 14:05:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:13,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:13,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:13,965 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-08 14:05:13,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:13,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:13,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:13,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:13,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:14,059 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-08 14:05:14,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:14,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:14,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:14,060 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-08 14:05:14,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:14,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:14,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:14,063 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:14,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:14,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:14,064 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:14,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:14,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:14,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:14,083 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 18 treesize of output 21 [2019-01-08 14:05:14,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:14,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:05:14,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:05:14,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:05:14,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,133 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:14,177 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-08 14:05:14,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,208 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:05:14,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:14,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:05:14,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-08 14:05:14,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:14,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:14,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:05:14,275 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-08 14:05:14,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:14,297 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-08 14:05:14,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:14,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:14,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:14,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:14,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:14,318 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-08 14:05:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:14,557 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-08 14:05:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:14,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:14,559 INFO L225 Difference]: With dead ends: 93 [2019-01-08 14:05:14,559 INFO L226 Difference]: Without dead ends: 92 [2019-01-08 14:05:14,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-08 14:05:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-08 14:05:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:05:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-08 14:05:14,583 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-08 14:05:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:14,583 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-08 14:05:14,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-08 14:05:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:14,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:14,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:14,584 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:14,585 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-08 14:05:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:14,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:14,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:14,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:14,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:14,776 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:14,777 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-08 14:05:14,777 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:14,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:14,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:14,780 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:14,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:14,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:14,781 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:14,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:14,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:14,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:14,800 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 18 treesize of output 21 [2019-01-08 14:05:14,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,802 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 21 treesize of output 27 [2019-01-08 14:05:14,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,809 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 23 treesize of output 37 [2019-01-08 14:05:14,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,814 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 25 treesize of output 51 [2019-01-08 14:05:14,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:14,929 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-08 14:05:14,930 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:14,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,133 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,170 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 36 treesize of output 66 [2019-01-08 14:05:15,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:15,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:15,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:15,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:15,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:15,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,333 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:15,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:05:15,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:15,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:15,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:15,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-08 14:05:15,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:15,471 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-08 14:05:15,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:05:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:15,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:15,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:15,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:15,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:15,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:15,614 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-08 14:05:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:16,552 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-08 14:05:16,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:16,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:16,554 INFO L225 Difference]: With dead ends: 117 [2019-01-08 14:05:16,554 INFO L226 Difference]: Without dead ends: 115 [2019-01-08 14:05:16,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:05:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-08 14:05:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-08 14:05:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-08 14:05:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-08 14:05:16,589 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-08 14:05:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:16,589 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-08 14:05:16,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-08 14:05:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:16,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:16,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:16,590 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:16,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:16,591 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-08 14:05:16,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:16,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:16,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:16,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:16,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:16,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:16,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:16,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:16,757 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-08 14:05:16,758 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:16,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:16,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:16,761 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:16,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:16,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:16,762 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:16,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:16,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:16,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:16,801 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 18 treesize of output 21 [2019-01-08 14:05:16,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:16,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:16,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:16,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:16,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:16,940 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:17,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:17,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:17,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:05:17,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:17,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:17,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:17,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:17,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:05:17,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:17,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:17,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:17,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:17,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:17,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:17,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:17,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:17,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:17,243 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-08 14:05:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:17,681 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-08 14:05:17,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:17,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:17,683 INFO L225 Difference]: With dead ends: 99 [2019-01-08 14:05:17,683 INFO L226 Difference]: Without dead ends: 98 [2019-01-08 14:05:17,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-08 14:05:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-08 14:05:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:05:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-08 14:05:17,717 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-08 14:05:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:17,718 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-08 14:05:17,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-08 14:05:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:17,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:17,719 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-08 14:05:17,719 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-08 14:05:17,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:17,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:17,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:18,078 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-01-08 14:05:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:18,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:18,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:18,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:18,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:18,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:18,164 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:18,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:05:18,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:05:18,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:05:18,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:18,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:18,183 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 18 treesize of output 21 [2019-01-08 14:05:18,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,187 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 21 treesize of output 27 [2019-01-08 14:05:18,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,194 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 23 treesize of output 37 [2019-01-08 14:05:18,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,203 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 25 treesize of output 51 [2019-01-08 14:05:18,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:18,221 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,248 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:18,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:18,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,342 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 36 treesize of output 66 [2019-01-08 14:05:18,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:18,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:18,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:18,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:18,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:18,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:05:18,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:18,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:18,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:18,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-08 14:05:18,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:18,667 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-08 14:05:18,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:18,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:18,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:18,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:05:18,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:18,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:05:18,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:05:18,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:18,770 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-08 14:05:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:19,505 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-08 14:05:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:19,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-08 14:05:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:19,507 INFO L225 Difference]: With dead ends: 132 [2019-01-08 14:05:19,507 INFO L226 Difference]: Without dead ends: 130 [2019-01-08 14:05:19,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:05:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-08 14:05:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-08 14:05:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-08 14:05:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-08 14:05:19,550 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-08 14:05:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:19,551 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-08 14:05:19,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:05:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-08 14:05:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:19,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:19,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:19,552 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-08 14:05:19,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:19,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:19,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:19,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:19,684 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-08 14:05:19,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:19,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:19,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:19,685 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-08 14:05:19,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:19,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:19,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:19,689 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:19,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:19,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:19,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:19,690 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:19,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:19,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:19,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:19,742 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 18 treesize of output 21 [2019-01-08 14:05:19,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,783 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 21 treesize of output 27 [2019-01-08 14:05:19,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,787 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 23 treesize of output 37 [2019-01-08 14:05:19,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,794 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 25 treesize of output 51 [2019-01-08 14:05:19,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,804 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:19,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:19,886 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,922 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 36 treesize of output 66 [2019-01-08 14:05:19,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:19,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:19,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:19,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:19,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:19,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,045 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-08 14:05:20,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:20,065 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-08 14:05:20,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:20,088 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-08 14:05:20,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:20,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:20,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:20,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:20,108 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-08 14:05:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:20,458 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-08 14:05:20,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:20,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:20,460 INFO L225 Difference]: With dead ends: 87 [2019-01-08 14:05:20,460 INFO L226 Difference]: Without dead ends: 86 [2019-01-08 14:05:20,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-08 14:05:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-08 14:05:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:05:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-08 14:05:20,502 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-08 14:05:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:20,502 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-08 14:05:20,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-08 14:05:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:20,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:20,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:20,503 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-08 14:05:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:20,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:20,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:20,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:20,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:20,669 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-08 14:05:20,670 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:20,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:20,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:20,673 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:20,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:20,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:20,674 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:20,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:20,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:20,695 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 18 treesize of output 21 [2019-01-08 14:05:20,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,699 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 21 treesize of output 27 [2019-01-08 14:05:20,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,706 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 23 treesize of output 37 [2019-01-08 14:05:20,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,716 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 25 treesize of output 51 [2019-01-08 14:05:20,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,730 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:20,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,773 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:20,831 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:20,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,863 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 36 treesize of output 66 [2019-01-08 14:05:20,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:20,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:20,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:20,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:20,985 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-08 14:05:20,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:21,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,018 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:21,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:05:21,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:21,070 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-08 14:05:21,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:21,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:21,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:21,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:21,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:21,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:21,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:21,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:21,131 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-08 14:05:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:21,582 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-08 14:05:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:21,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:21,585 INFO L225 Difference]: With dead ends: 106 [2019-01-08 14:05:21,585 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:05:21,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:05:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-08 14:05:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:05:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-08 14:05:21,628 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-08 14:05:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:21,628 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-08 14:05:21,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-08 14:05:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:21,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:21,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:21,629 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-08 14:05:21,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:21,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:21,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:21,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:21,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:21,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:21,823 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-08 14:05:21,825 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:21,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:21,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:21,828 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:21,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:21,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:21,830 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:21,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:21,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:21,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:21,883 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 18 treesize of output 21 [2019-01-08 14:05:21,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,899 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 21 treesize of output 27 [2019-01-08 14:05:21,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,907 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 23 treesize of output 37 [2019-01-08 14:05:21,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,916 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 25 treesize of output 51 [2019-01-08 14:05:21,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:21,949 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:21,950 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:21,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,022 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:22,060 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:22,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,114 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 36 treesize of output 66 [2019-01-08 14:05:22,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:22,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:22,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:22,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:22,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:22,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:22,301 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:22,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-08 14:05:22,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:22,355 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-08 14:05:22,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:22,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:22,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:22,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:22,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:22,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:22,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:22,433 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-08 14:05:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:22,954 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-08 14:05:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:22,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:22,956 INFO L225 Difference]: With dead ends: 102 [2019-01-08 14:05:22,956 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 14:05:22,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 14:05:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-08 14:05:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 14:05:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-08 14:05:22,993 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-08 14:05:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:22,993 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-08 14:05:22,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-08 14:05:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:22,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:22,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:22,994 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-08 14:05:22,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:22,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:22,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:22,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:23,084 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-08 14:05:23,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:23,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:23,084 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:23,085 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-08 14:05:23,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:23,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:23,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:23,091 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:23,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:23,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:23,092 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:23,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:23,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:23,115 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 18 treesize of output 21 [2019-01-08 14:05:23,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:23,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:23,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:23,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:23,217 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:23,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:23,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:23,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:23,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:23,424 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:23,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:05:23,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:23,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:23,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:05:23,471 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-08 14:05:23,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:23,492 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-08 14:05:23,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:23,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:23,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:23,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:23,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:23,511 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-08 14:05:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:23,791 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-08 14:05:23,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:23,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:23,793 INFO L225 Difference]: With dead ends: 94 [2019-01-08 14:05:23,793 INFO L226 Difference]: Without dead ends: 93 [2019-01-08 14:05:23,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-08 14:05:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-08 14:05:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 14:05:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-08 14:05:23,831 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-08 14:05:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:23,831 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-08 14:05:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-08 14:05:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:23,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:23,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:23,832 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-08 14:05:23,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:23,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:23,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:23,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:23,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:24,019 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:05:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:24,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:24,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:24,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:24,062 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-08 14:05:24,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:24,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:24,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:24,067 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:24,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:24,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:24,068 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:24,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:24,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:24,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:24,098 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 18 treesize of output 21 [2019-01-08 14:05:24,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:24,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:24,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:24,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:24,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:24,285 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:24,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:24,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:24,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:24,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:24,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:05:24,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:24,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:05:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:24,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-08 14:05:24,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:24,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:24,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:05:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:24,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:24,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:24,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:24,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:24,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:24,565 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-08 14:05:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:24,956 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-08 14:05:24,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:24,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:24,958 INFO L225 Difference]: With dead ends: 116 [2019-01-08 14:05:24,958 INFO L226 Difference]: Without dead ends: 115 [2019-01-08 14:05:24,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-08 14:05:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-08 14:05:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 14:05:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-08 14:05:24,994 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-08 14:05:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:24,994 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-08 14:05:24,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-08 14:05:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:24,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:24,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:24,995 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-08 14:05:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:24,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:24,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:25,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:25,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:25,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:25,145 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-08 14:05:25,145 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:25,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:25,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:25,149 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:25,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:25,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:25,150 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:25,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:25,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:25,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:25,174 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 18 treesize of output 21 [2019-01-08 14:05:25,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,178 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 21 treesize of output 27 [2019-01-08 14:05:25,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,187 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 23 treesize of output 37 [2019-01-08 14:05:25,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,195 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 25 treesize of output 51 [2019-01-08 14:05:25,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,213 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:25,214 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:25,295 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:25,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,364 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 36 treesize of output 66 [2019-01-08 14:05:25,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:25,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:25,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:25,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:25,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:25,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,553 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:25,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-08 14:05:25,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:25,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,708 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:25,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:25,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:05:25,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:25,777 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-08 14:05:25,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:25,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:25,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:25,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:25,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:25,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:25,881 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-08 14:05:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:26,794 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-08 14:05:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:26,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:26,796 INFO L225 Difference]: With dead ends: 140 [2019-01-08 14:05:26,796 INFO L226 Difference]: Without dead ends: 139 [2019-01-08 14:05:26,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-08 14:05:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-08 14:05:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-08 14:05:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-08 14:05:26,843 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-08 14:05:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:26,844 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-08 14:05:26,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-08 14:05:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:26,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:26,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:26,844 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:26,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:26,845 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-08 14:05:26,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:26,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:26,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:26,969 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-08 14:05:26,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:26,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:26,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:26,970 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-08 14:05:26,971 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:26,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:26,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:26,973 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:26,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:26,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:26,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:26,974 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:26,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:26,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:26,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:26,991 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 18 treesize of output 21 [2019-01-08 14:05:26,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:27,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:05:27,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:05:27,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:05:27,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:27,121 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-08 14:05:27,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,163 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:05:27,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:27,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:05:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:27,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:05:27,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:27,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:27,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:05:27,252 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-08 14:05:27,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:27,278 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-08 14:05:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:27,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:27,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:27,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:27,298 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-08 14:05:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:27,625 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-08 14:05:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:27,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:27,627 INFO L225 Difference]: With dead ends: 112 [2019-01-08 14:05:27,627 INFO L226 Difference]: Without dead ends: 111 [2019-01-08 14:05:27,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-08 14:05:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-08 14:05:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-08 14:05:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-08 14:05:27,680 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-08 14:05:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:27,681 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-08 14:05:27,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-08 14:05:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:27,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:27,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:27,682 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-08 14:05:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:27,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:27,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:27,889 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:05:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:27,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:27,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:27,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:27,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:27,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:27,982 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:27,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:27,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:27,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:27,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:27,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:28,002 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 18 treesize of output 21 [2019-01-08 14:05:28,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,009 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 21 treesize of output 27 [2019-01-08 14:05:28,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,017 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 23 treesize of output 37 [2019-01-08 14:05:28,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,025 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 25 treesize of output 51 [2019-01-08 14:05:28,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,038 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:28,039 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:28,138 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:28,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,177 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 36 treesize of output 72 [2019-01-08 14:05:28,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:28,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:28,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,260 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:28,261 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 36 treesize of output 80 [2019-01-08 14:05:28,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:28,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:28,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:05:28,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:28,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:28,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,472 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:28,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:28,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:05:28,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:28,522 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-08 14:05:28,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:28,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:28,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:28,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:28,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:28,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:28,631 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-08 14:05:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:29,532 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-08 14:05:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:29,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:29,535 INFO L225 Difference]: With dead ends: 137 [2019-01-08 14:05:29,535 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 14:05:29,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 14:05:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-08 14:05:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:05:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-08 14:05:29,578 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-08 14:05:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:29,578 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-08 14:05:29,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-08 14:05:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:29,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:29,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:29,579 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-08 14:05:29,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:29,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:29,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:30,070 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-08 14:05:30,324 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-08 14:05:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:30,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:30,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:30,352 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-08 14:05:30,352 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:30,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:30,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:30,355 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:30,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:30,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:30,355 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:30,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:30,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:30,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:30,376 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 18 treesize of output 21 [2019-01-08 14:05:30,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,384 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 21 treesize of output 27 [2019-01-08 14:05:30,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,393 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 23 treesize of output 37 [2019-01-08 14:05:30,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,400 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 25 treesize of output 51 [2019-01-08 14:05:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,408 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:30,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,434 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:30,489 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:30,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,520 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 36 treesize of output 72 [2019-01-08 14:05:30,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:30,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,607 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:30,608 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 36 treesize of output 80 [2019-01-08 14:05:30,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,715 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-08 14:05:30,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:30,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:30,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:30,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:30,797 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-08 14:05:30,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:30,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:30,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:30,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:30,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:30,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:30,866 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-08 14:05:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:31,349 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-08 14:05:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:31,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:31,352 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:05:31,352 INFO L226 Difference]: Without dead ends: 123 [2019-01-08 14:05:31,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-08 14:05:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-08 14:05:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:05:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-08 14:05:31,411 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-08 14:05:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:31,411 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-08 14:05:31,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-08 14:05:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:31,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:31,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:31,412 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-08 14:05:31,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:31,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:31,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:31,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:31,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:31,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:31,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:31,579 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-08 14:05:31,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:31,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:31,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:31,583 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:31,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:31,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:31,584 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:31,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:31,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:31,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:31,602 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 18 treesize of output 21 [2019-01-08 14:05:31,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,607 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 21 treesize of output 27 [2019-01-08 14:05:31,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,614 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 23 treesize of output 37 [2019-01-08 14:05:31,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,621 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 25 treesize of output 51 [2019-01-08 14:05:31,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,628 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:31,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:31,711 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:31,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,747 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 36 treesize of output 72 [2019-01-08 14:05:31,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:31,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:31,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:31,825 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 36 treesize of output 80 [2019-01-08 14:05:31,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:31,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:31,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:31,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:31,906 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 36 treesize of output 80 [2019-01-08 14:05:31,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:31,948 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-08 14:05:31,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:31,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:32,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:32,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:05:32,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:32,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:05:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:05:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:32,026 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-08 14:05:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:32,611 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-08 14:05:32,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:32,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:05:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:32,612 INFO L225 Difference]: With dead ends: 119 [2019-01-08 14:05:32,612 INFO L226 Difference]: Without dead ends: 118 [2019-01-08 14:05:32,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-08 14:05:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-08 14:05:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 14:05:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-08 14:05:32,668 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-08 14:05:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:32,668 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-08 14:05:32,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:05:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-08 14:05:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:32,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:32,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:32,669 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-08 14:05:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:32,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:32,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:32,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:32,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:32,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:32,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:32,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:32,814 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-08 14:05:32,817 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:32,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:32,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:32,819 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:32,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:32,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:32,820 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:32,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:32,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:32,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:32,843 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 18 treesize of output 21 [2019-01-08 14:05:32,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,848 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 21 treesize of output 27 [2019-01-08 14:05:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,854 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 23 treesize of output 37 [2019-01-08 14:05:32,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,865 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 25 treesize of output 51 [2019-01-08 14:05:32,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,873 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:32,874 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:32,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:32,953 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:32,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:32,989 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 36 treesize of output 72 [2019-01-08 14:05:32,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:33,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:33,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:33,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:33,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:33,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,154 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:33,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:05:33,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,200 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-08 14:05:33,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:33,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:33,253 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:33,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:05:33,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:33,303 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-08 14:05:33,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:33,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:33,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:33,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:05:33,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:33,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:33,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:33,384 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-08 14:05:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:34,410 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-08 14:05:34,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:34,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:34,412 INFO L225 Difference]: With dead ends: 149 [2019-01-08 14:05:34,412 INFO L226 Difference]: Without dead ends: 148 [2019-01-08 14:05:34,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:05:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-08 14:05:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-08 14:05:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-08 14:05:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-08 14:05:34,482 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-08 14:05:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:34,483 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-08 14:05:34,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-08 14:05:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:34,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:34,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:34,484 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-08 14:05:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:34,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:34,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:34,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:34,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:34,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:34,591 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-08 14:05:34,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:34,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:34,595 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:34,595 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:34,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:34,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:34,596 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:34,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:34,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:34,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:34,616 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 18 treesize of output 21 [2019-01-08 14:05:34,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:34,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:34,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:34,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:34,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,680 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:34,728 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:34,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:34,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:34,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:34,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:05:34,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:34,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:34,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:34,890 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:34,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:05:34,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:34,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:34,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:34,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:34,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:34,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:05:34,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:34,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:34,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:34,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:05:34,993 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-08 14:05:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:35,527 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-08 14:05:35,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:35,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:35,529 INFO L225 Difference]: With dead ends: 139 [2019-01-08 14:05:35,529 INFO L226 Difference]: Without dead ends: 138 [2019-01-08 14:05:35,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-08 14:05:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-08 14:05:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 14:05:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-08 14:05:35,597 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-08 14:05:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:35,597 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-08 14:05:35,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-08 14:05:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:35,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:35,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:35,598 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-08 14:05:35,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:35,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:35,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:35,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:35,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:35,765 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:05:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:35,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:35,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:35,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:35,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:35,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:35,858 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:35,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:35,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:35,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:35,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:35,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:35,879 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 18 treesize of output 21 [2019-01-08 14:05:35,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,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 21 treesize of output 27 [2019-01-08 14:05:35,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,893 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 23 treesize of output 37 [2019-01-08 14:05:35,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,905 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 25 treesize of output 51 [2019-01-08 14:05:35,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:35,914 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:35,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,942 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:35,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:35,997 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:36,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,032 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 36 treesize of output 72 [2019-01-08 14:05:36,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:36,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:36,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:36,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:36,117 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 36 treesize of output 80 [2019-01-08 14:05:36,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:36,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:36,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:36,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,204 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:36,205 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 36 treesize of output 80 [2019-01-08 14:05:36,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:36,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:36,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:36,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:36,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:36,339 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-08 14:05:36,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:36,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:36,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:36,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:36,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:36,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:36,438 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-08 14:05:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:37,244 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-08 14:05:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:37,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:37,246 INFO L225 Difference]: With dead ends: 164 [2019-01-08 14:05:37,246 INFO L226 Difference]: Without dead ends: 163 [2019-01-08 14:05:37,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-08 14:05:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-08 14:05:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-08 14:05:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-08 14:05:37,310 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-08 14:05:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:37,311 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-08 14:05:37,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-08 14:05:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:37,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:37,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:37,312 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-08 14:05:37,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:37,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:37,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:37,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:37,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:37,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:37,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:37,447 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-08 14:05:37,448 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:37,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:37,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:37,450 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:37,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:37,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:37,451 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:37,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:37,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:37,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:37,477 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 18 treesize of output 21 [2019-01-08 14:05:37,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,485 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 21 treesize of output 27 [2019-01-08 14:05:37,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,499 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 23 treesize of output 37 [2019-01-08 14:05:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,508 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 25 treesize of output 51 [2019-01-08 14:05:37,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,531 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:37,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:37,647 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:37,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,704 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 36 treesize of output 72 [2019-01-08 14:05:37,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:37,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:37,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:37,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:37,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:37,837 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-08 14:05:37,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:37,859 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-08 14:05:37,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:37,881 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-08 14:05:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:37,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:37,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:37,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:37,901 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-08 14:05:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:38,276 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-08 14:05:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:38,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:38,278 INFO L225 Difference]: With dead ends: 122 [2019-01-08 14:05:38,278 INFO L226 Difference]: Without dead ends: 121 [2019-01-08 14:05:38,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-08 14:05:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-08 14:05:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-08 14:05:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-08 14:05:38,348 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-08 14:05:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:38,348 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-08 14:05:38,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-08 14:05:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:38,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:38,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:38,349 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-08 14:05:38,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:38,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:38,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:38,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:38,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:38,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:38,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:38,502 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-08 14:05:38,502 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:38,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:38,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:38,505 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:05:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:38,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:38,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:38,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:38,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:38,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:38,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:38,525 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 18 treesize of output 21 [2019-01-08 14:05:38,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,530 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 21 treesize of output 27 [2019-01-08 14:05:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,536 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 23 treesize of output 37 [2019-01-08 14:05:38,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,549 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 25 treesize of output 51 [2019-01-08 14:05:38,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,560 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:38,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:38,641 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:38,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,674 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 36 treesize of output 72 [2019-01-08 14:05:38,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:38,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:38,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,753 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:38,754 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 36 treesize of output 80 [2019-01-08 14:05:38,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,795 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-08 14:05:38,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:38,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:38,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:05:38,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:38,881 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-08 14:05:38,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:38,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:38,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:38,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:38,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:38,949 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-08 14:05:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:39,517 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-08 14:05:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:39,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:39,520 INFO L225 Difference]: With dead ends: 154 [2019-01-08 14:05:39,520 INFO L226 Difference]: Without dead ends: 153 [2019-01-08 14:05:39,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-08 14:05:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-08 14:05:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 14:05:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-08 14:05:39,600 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-08 14:05:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:39,600 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-08 14:05:39,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-08 14:05:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:39,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:39,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:39,601 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-08 14:05:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:39,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:40,144 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:05:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:40,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:40,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:40,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:40,187 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-08 14:05:40,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:40,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:40,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:40,191 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:40,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:40,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:40,192 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:40,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:40,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:40,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:40,209 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 18 treesize of output 21 [2019-01-08 14:05:40,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:40,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:40,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:40,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:40,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:40,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:40,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:40,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:40,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:40,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:40,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:05:40,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:40,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:40,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:40,448 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-08 14:05:40,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:40,473 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-08 14:05:40,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:40,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:40,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:40,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:40,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:40,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:40,494 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-08 14:05:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:40,827 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-08 14:05:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:40,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:40,830 INFO L225 Difference]: With dead ends: 130 [2019-01-08 14:05:40,830 INFO L226 Difference]: Without dead ends: 129 [2019-01-08 14:05:40,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-08 14:05:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-08 14:05:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 14:05:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-08 14:05:40,907 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-08 14:05:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:40,907 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-08 14:05:40,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-08 14:05:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:40,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:40,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:40,908 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-08 14:05:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:40,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:40,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:41,388 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-08 14:05:41,689 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-01-08 14:05:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:41,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:41,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:41,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:41,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:41,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:41,702 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:41,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:41,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:41,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:41,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:41,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:41,720 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 18 treesize of output 21 [2019-01-08 14:05:41,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,725 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 21 treesize of output 27 [2019-01-08 14:05:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,731 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 23 treesize of output 37 [2019-01-08 14:05:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,739 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 25 treesize of output 51 [2019-01-08 14:05:41,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,751 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:41,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:41,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:41,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:41,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:41,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:41,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:41,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,872 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 36 treesize of output 72 [2019-01-08 14:05:41,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:41,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:41,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:41,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:41,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:41,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:42,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:42,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:42,060 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:42,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:05:42,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:42,121 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-08 14:05:42,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:42,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:42,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:42,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:05:42,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:42,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:05:42,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:05:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:42,190 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-08 14:05:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:42,773 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-08 14:05:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:42,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-08 14:05:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:42,777 INFO L225 Difference]: With dead ends: 160 [2019-01-08 14:05:42,777 INFO L226 Difference]: Without dead ends: 159 [2019-01-08 14:05:42,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:05:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-08 14:05:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-08 14:05:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-08 14:05:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-08 14:05:42,883 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-08 14:05:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:42,883 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-08 14:05:42,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:05:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-08 14:05:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:42,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:42,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:42,884 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:42,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:42,885 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-08 14:05:42,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:42,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:42,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:42,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:42,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:43,026 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:05:43,033 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-08 14:05:43,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:43,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:43,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:43,034 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-08 14:05:43,035 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:43,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:43,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:43,038 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:43,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:43,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:43,039 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:43,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:43,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:43,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:43,060 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 18 treesize of output 21 [2019-01-08 14:05:43,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:43,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:43,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:43,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:43,104 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:43,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:43,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:43,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:43,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:43,273 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-08 14:05:43,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:43,299 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-08 14:05:43,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:05:43,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-08 14:05:43,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:05:43,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:05:43,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:05:43,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:05:43,318 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-08 14:05:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:43,432 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-08 14:05:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:05:43,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 14:05:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:43,434 INFO L225 Difference]: With dead ends: 121 [2019-01-08 14:05:43,434 INFO L226 Difference]: Without dead ends: 117 [2019-01-08 14:05:43,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:05:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-08 14:05:43,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-08 14:05:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-08 14:05:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-08 14:05:43,512 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-08 14:05:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:43,512 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-08 14:05:43,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:05:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-08 14:05:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:43,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:43,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:43,513 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-08 14:05:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:43,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:43,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:43,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:43,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:43,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:43,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:43,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:43,717 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:43,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:43,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:43,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:43,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:43,737 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 18 treesize of output 21 [2019-01-08 14:05:43,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,744 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 21 treesize of output 27 [2019-01-08 14:05:43,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,754 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 23 treesize of output 37 [2019-01-08 14:05:43,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,762 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 25 treesize of output 51 [2019-01-08 14:05:43,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,770 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:43,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,797 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:43,853 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:43,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,891 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 36 treesize of output 72 [2019-01-08 14:05:43,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:43,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:43,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:43,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:05:43,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:44,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,059 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:44,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-08 14:05:44,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:44,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:44,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:44,286 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:44,286 INFO L303 Elim1Store]: Index analysis took 154 ms [2019-01-08 14:05:44,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:05:44,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:44,485 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-08 14:05:44,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:44,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:44,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:44,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:44,588 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-08 14:05:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:45,520 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-08 14:05:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:45,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:45,523 INFO L225 Difference]: With dead ends: 186 [2019-01-08 14:05:45,524 INFO L226 Difference]: Without dead ends: 184 [2019-01-08 14:05:45,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-08 14:05:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-08 14:05:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-08 14:05:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-08 14:05:45,607 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-08 14:05:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:45,608 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-08 14:05:45,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-08 14:05:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:45,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:45,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:45,609 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-08 14:05:45,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:45,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:45,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:45,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:45,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:45,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:05:45,741 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-08 14:05:45,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:45,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:45,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:45,745 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 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-08 14:05:45,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:45,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:45,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:45,746 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:45,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:45,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:45,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:45,765 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 18 treesize of output 21 [2019-01-08 14:05:45,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:45,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:45,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:45,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:45,872 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:45,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:45,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:45,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:45,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:45,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:05:45,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:45,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:45,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:46,007 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-08 14:05:46,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:46,019 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-08 14:05:46,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:46,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:46,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:46,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:46,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:46,039 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-08 14:05:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:46,396 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-08 14:05:46,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:46,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:46,399 INFO L225 Difference]: With dead ends: 161 [2019-01-08 14:05:46,399 INFO L226 Difference]: Without dead ends: 160 [2019-01-08 14:05:46,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-08 14:05:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-08 14:05:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 14:05:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-08 14:05:46,526 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-08 14:05:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:46,526 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-08 14:05:46,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-08 14:05:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:46,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:46,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:46,527 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-08 14:05:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:46,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:46,674 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-08 14:05:46,698 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-08 14:05:46,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:46,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:46,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:46,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:46,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:46,699 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:46,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:46,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:46,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:05:46,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:46,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:46,717 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 18 treesize of output 21 [2019-01-08 14:05:46,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:46,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:05:46,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:05:46,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:05:46,750 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:46,808 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-08 14:05:46,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:05:46,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:46,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:05:46,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:46,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:05:46,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:46,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:46,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:05:46,913 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-08 14:05:46,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:46,932 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-08 14:05:46,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:46,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:46,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:46,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:46,951 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-08 14:05:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:47,302 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-08 14:05:47,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:47,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-08 14:05:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:47,305 INFO L225 Difference]: With dead ends: 172 [2019-01-08 14:05:47,305 INFO L226 Difference]: Without dead ends: 170 [2019-01-08 14:05:47,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-08 14:05:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-08 14:05:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-08 14:05:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-08 14:05:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-08 14:05:47,409 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-08 14:05:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:47,409 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-08 14:05:47,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-08 14:05:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:47,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:47,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:47,410 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-08 14:05:47,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:47,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:47,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:47,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:47,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:47,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:47,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:47,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:47,615 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:47,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:05:47,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:05:47,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:05:47,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:47,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:47,634 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 18 treesize of output 21 [2019-01-08 14:05:47,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,640 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 21 treesize of output 27 [2019-01-08 14:05:47,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,645 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 23 treesize of output 37 [2019-01-08 14:05:47,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,658 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 25 treesize of output 51 [2019-01-08 14:05:47,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,671 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:47,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:47,773 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:47,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,831 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 36 treesize of output 72 [2019-01-08 14:05:47,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:47,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:47,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,941 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:47,942 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 36 treesize of output 80 [2019-01-08 14:05:47,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:47,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:05:48,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:48,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:48,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,107 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:48,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:05:48,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,158 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-08 14:05:48,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:48,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:48,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:48,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:48,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:48,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:48,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:48,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:48,271 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-08 14:05:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:49,078 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-08 14:05:49,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:49,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-08 14:05:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:49,081 INFO L225 Difference]: With dead ends: 209 [2019-01-08 14:05:49,081 INFO L226 Difference]: Without dead ends: 207 [2019-01-08 14:05:49,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-08 14:05:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-08 14:05:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-08 14:05:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-08 14:05:49,174 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-08 14:05:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:49,175 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-08 14:05:49,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-08 14:05:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:05:49,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:49,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:05:49,175 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-08 14:05:49,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:49,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:49,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:49,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:49,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:49,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:49,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:49,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:49,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:49,283 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:49,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:49,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:05:49,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:49,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:49,304 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 18 treesize of output 21 [2019-01-08 14:05:49,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:49,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:49,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:49,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:49,422 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:49,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:05:49,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:49,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:05:49,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:49,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:49,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:49,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:49,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-08 14:05:49,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:49,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:49,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:49,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:49,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:49,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:05:49,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:49,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:05:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:05:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:49,771 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-08 14:05:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:50,283 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-08 14:05:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:50,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-08 14:05:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:50,286 INFO L225 Difference]: With dead ends: 180 [2019-01-08 14:05:50,286 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 14:05:50,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:05:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 14:05:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-08 14:05:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-08 14:05:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-08 14:05:50,392 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-08 14:05:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-08 14:05:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:05:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-08 14:05:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:50,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:50,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:50,394 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-08 14:05:50,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:50,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:05:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:50,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:50,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:50,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:50,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:50,549 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-08 14:05:50,550 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:50,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:50,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:50,552 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:50,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:50,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:50,553 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:50,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:50,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:50,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:50,575 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 18 treesize of output 21 [2019-01-08 14:05:50,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,578 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 21 treesize of output 27 [2019-01-08 14:05:50,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,583 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 23 treesize of output 37 [2019-01-08 14:05:50,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,590 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 25 treesize of output 51 [2019-01-08 14:05:50,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,601 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:50,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:50,685 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:50,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,721 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 36 treesize of output 66 [2019-01-08 14:05:50,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:50,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:50,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:50,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:50,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:50,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,885 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:50,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:05:50,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:50,934 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-08 14:05:50,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:50,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,971 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:50,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:50,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:05:50,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:51,020 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-08 14:05:51,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:51,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:51,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:05:51,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:51,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:51,773 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-08 14:05:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:52,678 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-08 14:05:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:05:52,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:05:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:52,680 INFO L225 Difference]: With dead ends: 189 [2019-01-08 14:05:52,680 INFO L226 Difference]: Without dead ends: 188 [2019-01-08 14:05:52,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-08 14:05:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-08 14:05:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 14:05:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-08 14:05:52,792 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-08 14:05:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:52,792 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-08 14:05:52,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-08 14:05:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:52,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:52,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:52,793 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-08 14:05:52,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:52,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:52,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:52,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:53,043 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-08 14:05:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:05:53,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:53,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:53,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:53,143 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-08 14:05:53,144 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:53,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:53,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:53,146 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:53,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:53,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:53,147 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:53,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:53,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:53,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:53,163 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 18 treesize of output 21 [2019-01-08 14:05:53,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,166 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 21 treesize of output 27 [2019-01-08 14:05:53,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,174 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 23 treesize of output 37 [2019-01-08 14:05:53,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,187 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 25 treesize of output 51 [2019-01-08 14:05:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,197 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:53,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,224 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,279 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:53,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,318 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 36 treesize of output 66 [2019-01-08 14:05:53,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:53,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:53,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:53,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:53,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:53,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:53,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:05:53,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:53,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:53,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:53,574 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:53,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:05:53,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:53,622 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-08 14:05:53,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:53,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:53,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:53,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:05:53,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:53,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:05:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:05:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:05:53,726 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-08 14:05:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:54,533 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-08 14:05:54,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:54,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:05:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:54,536 INFO L225 Difference]: With dead ends: 169 [2019-01-08 14:05:54,536 INFO L226 Difference]: Without dead ends: 168 [2019-01-08 14:05:54,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-08 14:05:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-08 14:05:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-08 14:05:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-08 14:05:54,653 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-08 14:05:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:54,653 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-08 14:05:54,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:05:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-08 14:05:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:54,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:54,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:54,654 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-08 14:05:54,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:54,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:54,724 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-08 14:05:54,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:54,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:54,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:54,724 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-08 14:05:54,725 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:54,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:54,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:54,727 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:05:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:54,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:54,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:54,728 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:54,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:54,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:54,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:54,745 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 18 treesize of output 21 [2019-01-08 14:05:54,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:54,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:05:54,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-08 14:05:54,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-08 14:05:54,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:54,860 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-08 14:05:54,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-08 14:05:54,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:05:54,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:54,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:54,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:54,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:54,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-08 14:05:54,932 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-08 14:05:54,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:54,951 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-08 14:05:54,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:54,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:54,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:54,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:54,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:54,971 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-08 14:05:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:55,273 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-08 14:05:55,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:55,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:05:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:55,276 INFO L225 Difference]: With dead ends: 159 [2019-01-08 14:05:55,276 INFO L226 Difference]: Without dead ends: 158 [2019-01-08 14:05:55,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:05:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-08 14:05:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-08 14:05:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-08 14:05:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-08 14:05:55,383 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-08 14:05:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:55,383 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-08 14:05:55,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-08 14:05:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:55,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:55,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:55,384 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-08 14:05:55,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:55,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:55,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:55,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:55,898 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-08 14:05:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:56,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:56,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:56,016 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:56,016 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-08 14:05:56,017 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:56,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:56,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:56,020 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-08 14:05:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:56,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:56,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:56,020 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:56,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:56,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:56,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:56,040 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 18 treesize of output 21 [2019-01-08 14:05:56,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,046 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 21 treesize of output 27 [2019-01-08 14:05:56,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,086 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 23 treesize of output 37 [2019-01-08 14:05:56,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,099 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 25 treesize of output 51 [2019-01-08 14:05:56,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,110 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:56,111 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,192 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:05:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,225 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 36 treesize of output 66 [2019-01-08 14:05:56,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:56,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:05:56,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:56,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:56,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:05:56,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,382 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:56,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:05:56,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:56,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-08 14:05:56,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:56,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-08 14:05:56,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:56,522 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-08 14:05:56,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:05:56,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:56,585 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:56,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:05:56,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05: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-08 14:05:56,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:05:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:56,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:56,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:56,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-08 14:05:56,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:56,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:05:56,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:05:56,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:05:56,750 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-08 14:05:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:58,067 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-08 14:05:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:05:58,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-08 14:05:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:58,070 INFO L225 Difference]: With dead ends: 199 [2019-01-08 14:05:58,070 INFO L226 Difference]: Without dead ends: 198 [2019-01-08 14:05:58,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:05:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-08 14:05:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-08 14:05:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-08 14:05:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-08 14:05:58,179 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-08 14:05:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:58,179 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-08 14:05:58,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:05:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-08 14:05:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:58,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:58,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:58,180 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-08 14:05:58,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:58,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:58,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:58,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:58,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:58,363 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-08 14:05:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:58,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:58,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:58,436 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:05:58,436 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-08 14:05:58,437 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:58,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:58,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:58,441 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:05:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:58,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:58,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:58,442 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:58,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:58,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:58,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:58,459 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 18 treesize of output 21 [2019-01-08 14:05:58,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:05:58,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:05:58,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:05:58,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:05:58,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:58,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:05:58,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:05:58,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:58,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:05:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:05:58,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:58,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:05:58,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,706 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:58,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:05:58,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:58,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:05:58,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:58,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:58,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:05:58,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:58,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:58,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:05:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:58,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:05:58,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:05:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:05:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:05:58,893 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-08 14:05:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:59,546 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-08 14:05:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:05:59,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:05:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:59,549 INFO L225 Difference]: With dead ends: 181 [2019-01-08 14:05:59,549 INFO L226 Difference]: Without dead ends: 180 [2019-01-08 14:05:59,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:05:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-08 14:05:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-08 14:05:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-08 14:05:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-08 14:05:59,669 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-08 14:05:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:59,669 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-08 14:05:59,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:05:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-08 14:05:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:05:59,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:59,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:05:59,670 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:59,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-08 14:05:59,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:59,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:59,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:59,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:59,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:59,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:59,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:59,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:05:59,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:05:59,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:59,899 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:05:59,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:05:59,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:05:59,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:05:59,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:05:59,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:59,921 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 18 treesize of output 21 [2019-01-08 14:05:59,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,923 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 21 treesize of output 27 [2019-01-08 14:05:59,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,927 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 23 treesize of output 37 [2019-01-08 14:05:59,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,932 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 25 treesize of output 51 [2019-01-08 14:05:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:59,940 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:05:59,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:59,967 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:59,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:59,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,020 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:00,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,056 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 36 treesize of output 66 [2019-01-08 14:06:00,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:00,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:00,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:06:00,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:00,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:00,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,228 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:00,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:06:00,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:00,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:00,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:00,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:06:00,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:00,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:00,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,398 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:00,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:00,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:06:00,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:00,448 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-08 14:06:00,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:00,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:00,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:00,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-08 14:06:00,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:00,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:06:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:06:00,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:00,577 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-08 14:06:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:01,837 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-08 14:06:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:01,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-08 14:06:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:01,840 INFO L225 Difference]: With dead ends: 200 [2019-01-08 14:06:01,840 INFO L226 Difference]: Without dead ends: 199 [2019-01-08 14:06:01,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:06:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-08 14:06:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-08 14:06:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-08 14:06:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-08 14:06:01,952 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-08 14:06:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:01,952 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-08 14:06:01,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:06:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-08 14:06:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:01,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:01,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:01,953 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:01,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:01,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-08 14:06:01,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:01,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:01,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:02,193 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:06:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:02,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:02,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:02,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:02,262 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-08 14:06:02,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:02,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:02,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:02,266 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:02,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:02,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:02,267 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:02,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:02,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:02,288 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 18 treesize of output 21 [2019-01-08 14:06:02,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,292 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 21 treesize of output 27 [2019-01-08 14:06:02,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,296 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 23 treesize of output 37 [2019-01-08 14:06:02,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,303 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 25 treesize of output 51 [2019-01-08 14:06:02,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,312 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:02,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:02,393 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:02,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,427 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 36 treesize of output 66 [2019-01-08 14:06:02,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:02,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:02,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:06:02,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:02,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,601 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:02,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:02,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:06:02,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:02,651 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-08 14:06:02,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:02,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:02,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:02,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:02,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:02,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:02,729 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-08 14:06:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:03,319 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-08 14:06:03,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:06:03,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:03,322 INFO L225 Difference]: With dead ends: 160 [2019-01-08 14:06:03,322 INFO L226 Difference]: Without dead ends: 159 [2019-01-08 14:06:03,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:06:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-08 14:06:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-08 14:06:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-08 14:06:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-08 14:06:03,443 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-08 14:06:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:03,444 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-08 14:06:03,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-08 14:06:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:03,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:03,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:03,444 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-08 14:06:03,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:03,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:03,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:03,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:03,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:03,588 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-08 14:06:03,589 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:03,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:03,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:03,592 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:06:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:03,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:03,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:03,592 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:03,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:03,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:03,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:03,614 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 18 treesize of output 21 [2019-01-08 14:06:03,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,618 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 21 treesize of output 27 [2019-01-08 14:06:03,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,624 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 23 treesize of output 37 [2019-01-08 14:06:03,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,630 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 25 treesize of output 51 [2019-01-08 14:06:03,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,637 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:03,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,664 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:03,733 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:03,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,769 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 36 treesize of output 66 [2019-01-08 14:06:03,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:03,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:03,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:06:03,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:03,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:03,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:03,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:03,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-08 14:06:03,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:03,983 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-08 14:06:03,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:04,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,018 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:04,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:06:04,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,064 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-08 14:06:04,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:04,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:04,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:04,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:06:04,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:04,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:06:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:06:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:04,153 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-08 14:06:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:04,951 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-08 14:06:04,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:04,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:06:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:04,953 INFO L225 Difference]: With dead ends: 197 [2019-01-08 14:06:04,954 INFO L226 Difference]: Without dead ends: 196 [2019-01-08 14:06:04,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:06:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-08 14:06:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-08 14:06:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-08 14:06:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-08 14:06:05,083 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-08 14:06:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:05,084 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-08 14:06:05,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:06:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-08 14:06:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:05,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:05,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:05,085 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-08 14:06:05,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:05,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:05,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:05,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:05,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:05,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:05,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:05,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:05,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:05,253 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:05,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:05,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:05,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:05,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:05,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:05,272 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 18 treesize of output 21 [2019-01-08 14:06:05,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,278 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 21 treesize of output 27 [2019-01-08 14:06:05,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,284 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 23 treesize of output 37 [2019-01-08 14:06:05,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,368 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 25 treesize of output 51 [2019-01-08 14:06:05,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,386 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:05,386 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,412 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:05,465 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:05,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,501 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 36 treesize of output 66 [2019-01-08 14:06:05,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:05,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:05,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,576 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:05,577 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 38 treesize of output 81 [2019-01-08 14:06:05,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:05,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:05,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-08 14:06:05,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:05,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:05,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,741 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:05,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:06:05,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,786 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-08 14:06:05,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:05,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:05,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:05,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:06:05,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:05,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:06:05,883 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-08 14:06:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:06,724 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-08 14:06:06,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:06,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:06,727 INFO L225 Difference]: With dead ends: 195 [2019-01-08 14:06:06,727 INFO L226 Difference]: Without dead ends: 189 [2019-01-08 14:06:06,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:06,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-08 14:06:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-08 14:06:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-08 14:06:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-08 14:06:06,885 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-08 14:06:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:06,885 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-08 14:06:06,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-08 14:06:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:06,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:06,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:06,886 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-08 14:06:06,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:06,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:06,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:07,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:07,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:07,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:07,024 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-08 14:06:07,027 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:07,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:07,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:07,029 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:07,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:07,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:07,030 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:07,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:07,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:07,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:07,048 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 18 treesize of output 21 [2019-01-08 14:06:07,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:07,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:06:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:06:07,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:06:07,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,108 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:07,154 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:06:07,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:06:07,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:07,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:07,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,242 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:07,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:06:07,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:07,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:06:07,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:06:07,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:07,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:07,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:06:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:07,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:07,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:07,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:07,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:07,407 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-08 14:06:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:07,923 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-08 14:06:07,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:06:07,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:07,925 INFO L225 Difference]: With dead ends: 157 [2019-01-08 14:06:07,925 INFO L226 Difference]: Without dead ends: 156 [2019-01-08 14:06:07,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:06:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-08 14:06:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-08 14:06:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-08 14:06:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-08 14:06:08,052 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-08 14:06:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:08,052 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-08 14:06:08,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-08 14:06:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:08,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:08,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:08,053 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-08 14:06:08,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:08,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:08,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:08,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:08,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:08,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:08,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:08,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:08,255 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:08,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:08,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:08,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:08,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:08,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:08,274 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 18 treesize of output 21 [2019-01-08 14:06:08,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:06:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:06:08,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:06:08,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,374 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:06:08,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:06:08,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:08,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,472 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:08,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:06:08,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-08 14:06:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:06:08,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-08 14:06:08,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,596 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:08,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:06:08,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:06:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:08,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:08,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:08,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:06:08,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:08,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:06:08,727 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-08 14:06:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:09,374 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-08 14:06:09,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:09,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:09,377 INFO L225 Difference]: With dead ends: 178 [2019-01-08 14:06:09,377 INFO L226 Difference]: Without dead ends: 177 [2019-01-08 14:06:09,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-08 14:06:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-08 14:06:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-08 14:06:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-08 14:06:09,506 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-08 14:06:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:09,506 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-08 14:06:09,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-08 14:06:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:09,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:09,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:09,508 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-08 14:06:09,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:09,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:09,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:09,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:09,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:09,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:09,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:09,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:09,697 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:09,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:09,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:09,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:09,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:09,716 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 18 treesize of output 21 [2019-01-08 14:06:09,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,719 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 21 treesize of output 27 [2019-01-08 14:06:09,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,722 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 23 treesize of output 37 [2019-01-08 14:06:09,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,728 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 25 treesize of output 51 [2019-01-08 14:06:09,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,733 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:09,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:09,813 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:09,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,849 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 36 treesize of output 66 [2019-01-08 14:06:09,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:09,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:09,929 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 38 treesize of output 81 [2019-01-08 14:06:09,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:09,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:09,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:09,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:09,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-08 14:06:10,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:10,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:10,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:10,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:10,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:10,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-08 14:06:10,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:10,151 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-08 14:06:10,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:10,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:10,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:10,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:06:10,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:10,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:10,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:10,248 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-08 14:06:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:11,188 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-08 14:06:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:06:11,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:11,191 INFO L225 Difference]: With dead ends: 204 [2019-01-08 14:06:11,191 INFO L226 Difference]: Without dead ends: 203 [2019-01-08 14:06:11,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:06:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-08 14:06:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-08 14:06:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-08 14:06:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-08 14:06:11,311 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-08 14:06:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:11,312 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-08 14:06:11,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-08 14:06:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:11,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:11,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:11,313 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-08 14:06:11,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:11,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:11,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:11,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:11,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:11,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:11,437 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-08 14:06:11,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:11,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:11,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:11,441 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:11,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:11,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:11,442 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:11,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:11,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:11,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:11,467 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 18 treesize of output 21 [2019-01-08 14:06:11,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:11,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:06:11,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:06:11,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:06:11,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:11,578 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:06:11,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:06:11,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:11,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:11,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:11,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:06:11,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:11,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:06:11,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-08 14:06:11,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:11,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:11,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:06:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:11,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:11,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:11,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:06:11,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:11,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:11,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:11,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:11,894 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-08 14:06:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:12,444 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-08 14:06:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:12,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:12,447 INFO L225 Difference]: With dead ends: 178 [2019-01-08 14:06:12,447 INFO L226 Difference]: Without dead ends: 177 [2019-01-08 14:06:12,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-08 14:06:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-08 14:06:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-08 14:06:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-08 14:06:12,560 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-08 14:06:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:12,561 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-08 14:06:12,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-08 14:06:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:12,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:12,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:12,562 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-08 14:06:12,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:12,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:12,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:12,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:12,640 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-08 14:06:12,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:12,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:12,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:12,641 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-08 14:06:12,641 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:12,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:12,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:12,644 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:12,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:12,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:12,644 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:12,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:12,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:12,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:12,661 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 18 treesize of output 21 [2019-01-08 14:06:12,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:12,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:06:12,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:06:12,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:06:12,695 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:12,751 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-08 14:06:12,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,780 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:06:12,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:12,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:12,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:06:12,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:12,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:06:12,850 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-08 14:06:12,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:12,868 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-08 14:06:12,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:12,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:12,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:12,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:12,889 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-08 14:06:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:13,261 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-08 14:06:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:06:13,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:06:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:13,263 INFO L225 Difference]: With dead ends: 134 [2019-01-08 14:06:13,263 INFO L226 Difference]: Without dead ends: 133 [2019-01-08 14:06:13,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:06:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-08 14:06:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-08 14:06:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-08 14:06:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-08 14:06:13,382 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-08 14:06:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:13,382 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-08 14:06:13,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-08 14:06:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:13,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:13,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:13,383 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-08 14:06:13,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:13,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:13,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:13,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:13,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:13,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:13,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:13,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:13,539 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-08 14:06:13,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:13,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:13,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:13,542 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:13,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:13,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:13,542 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:13,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:13,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:13,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:13,591 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 18 treesize of output 21 [2019-01-08 14:06:13,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,637 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 21 treesize of output 27 [2019-01-08 14:06:13,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,699 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 23 treesize of output 37 [2019-01-08 14:06:13,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,782 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 25 treesize of output 51 [2019-01-08 14:06:13,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,894 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-08 14:06:13,895 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:13,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:14,178 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:14,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,212 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 36 treesize of output 72 [2019-01-08 14:06:14,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:14,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:14,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:14,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:14,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:14,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:14,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:14,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:06:14,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:14,425 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-08 14:06:14,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:14,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:14,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:14,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:14,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:14,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:14,507 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-08 14:06:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:15,087 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-08 14:06:15,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:06:15,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:15,089 INFO L225 Difference]: With dead ends: 143 [2019-01-08 14:06:15,089 INFO L226 Difference]: Without dead ends: 142 [2019-01-08 14:06:15,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:06:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-08 14:06:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-08 14:06:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-08 14:06:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-08 14:06:15,207 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-08 14:06:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:15,208 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-08 14:06:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-08 14:06:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:15,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:15,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:15,217 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-08 14:06:15,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:15,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:15,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:15,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:15,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:15,480 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-08 14:06:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:15,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:15,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:15,508 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:15,508 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-08 14:06:15,511 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:15,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:15,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:15,513 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:15,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:15,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:15,514 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:15,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:15,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:15,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:15,529 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 18 treesize of output 21 [2019-01-08 14:06:15,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:15,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:06:15,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:06:15,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:06:15,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:15,618 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-08 14:06:15,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,648 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:06:15,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:15,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:15,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:06:15,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:15,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:15,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:15,721 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:15,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-08 14:06:15,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:15,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:15,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:06:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:15,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:15,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:15,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:06:15,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:15,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:15,798 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-08 14:06:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:16,273 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-08 14:06:16,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:16,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:16,275 INFO L225 Difference]: With dead ends: 151 [2019-01-08 14:06:16,275 INFO L226 Difference]: Without dead ends: 150 [2019-01-08 14:06:16,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:06:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-08 14:06:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-08 14:06:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-08 14:06:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-08 14:06:16,400 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-08 14:06:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:16,400 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-08 14:06:16,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-08 14:06:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:16,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:16,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:16,401 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-08 14:06:16,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:16,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:16,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:16,636 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-08 14:06:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:16,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:16,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:16,713 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:16,713 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-08 14:06:16,713 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:16,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:16,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:16,716 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:06:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:16,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:16,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:16,717 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:16,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:16,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:16,732 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 18 treesize of output 21 [2019-01-08 14:06:16,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,740 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 21 treesize of output 27 [2019-01-08 14:06:16,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,744 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 23 treesize of output 37 [2019-01-08 14:06:16,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,845 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 25 treesize of output 51 [2019-01-08 14:06:16,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,877 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:16,877 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:16,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:16,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,986 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 36 treesize of output 72 [2019-01-08 14:06:16,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:17,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:17,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,059 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:17,060 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 36 treesize of output 80 [2019-01-08 14:06:17,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:17,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:17,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,141 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:17,142 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 36 treesize of output 80 [2019-01-08 14:06:17,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,186 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-08 14:06:17,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:17,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:17,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:06:17,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,353 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-08 14:06:17,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:17,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:17,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:17,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:06:17,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:17,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:17,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:17,440 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-08 14:06:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:18,284 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-08 14:06:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:18,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:18,286 INFO L225 Difference]: With dead ends: 215 [2019-01-08 14:06:18,287 INFO L226 Difference]: Without dead ends: 214 [2019-01-08 14:06:18,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-08 14:06:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-08 14:06:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-08 14:06:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-08 14:06:18,438 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-08 14:06:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:18,439 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-08 14:06:18,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-08 14:06:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:18,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:18,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:18,440 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-08 14:06:18,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:18,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:18,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:18,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:18,457 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-08 14:06:18,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:18,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:18,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:18,458 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-08 14:06:18,461 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:18,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:18,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:18,463 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:18,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:18,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:18,463 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:18,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:18,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:18,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:18,491 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 18 treesize of output 21 [2019-01-08 14:06:18,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:18,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:06:18,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-08 14:06:18,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-08 14:06:18,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,591 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-08 14:06:18,592 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-08 14:06:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-08 14:06:18,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-08 14:06:18,610 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-08 14:06:18,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:18,624 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-08 14:06:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:06:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:06:18,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:06:18,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:06:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:06:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:18,644 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-08 14:06:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:19,020 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-08 14:06:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:06:19,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-08 14:06:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:19,025 INFO L225 Difference]: With dead ends: 280 [2019-01-08 14:06:19,025 INFO L226 Difference]: Without dead ends: 275 [2019-01-08 14:06:19,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-08 14:06:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-08 14:06:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-08 14:06:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-08 14:06:19,326 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-08 14:06:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:19,326 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-08 14:06:19,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:06:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-08 14:06:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:19,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:19,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:19,327 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:19,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-08 14:06:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:19,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:19,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:19,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:19,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:19,938 WARN L181 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-08 14:06:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:20,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:20,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:20,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:20,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:20,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:20,058 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:20,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:20,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:20,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:20,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:20,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:20,079 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 18 treesize of output 21 [2019-01-08 14:06:20,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,082 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 21 treesize of output 27 [2019-01-08 14:06:20,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,087 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 23 treesize of output 37 [2019-01-08 14:06:20,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,092 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 25 treesize of output 51 [2019-01-08 14:06:20,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,100 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:20,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:20,181 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:20,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,218 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 36 treesize of output 72 [2019-01-08 14:06:20,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:20,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:20,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:06:20,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:20,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:20,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:20,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:06:20,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:20,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:20,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,471 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:20,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:06:20,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,518 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-08 14:06:20,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:20,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:06:20,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:20,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:06:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:06:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:20,611 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-08 14:06:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:21,648 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-08 14:06:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:21,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-08 14:06:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:21,652 INFO L225 Difference]: With dead ends: 329 [2019-01-08 14:06:21,652 INFO L226 Difference]: Without dead ends: 328 [2019-01-08 14:06:21,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:06:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-08 14:06:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-08 14:06:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-08 14:06:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-08 14:06:21,976 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-08 14:06:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:21,977 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-08 14:06:21,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:06:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-08 14:06:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:21,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:21,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:21,978 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-08 14:06:21,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:21,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:21,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:21,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:22,136 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-08 14:06:22,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:22,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:22,137 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:22,137 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-08 14:06:22,138 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:22,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:22,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:22,140 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:22,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:22,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:22,141 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:22,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:22,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:22,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:22,195 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 18 treesize of output 21 [2019-01-08 14:06:22,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:22,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:06:22,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:06:22,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:06:22,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,288 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:22,313 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:06:22,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:06:22,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:22,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:22,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:22,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:06:22,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:22,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:22,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:22,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:22,476 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-08 14:06:22,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:22,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:22,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:22,496 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-08 14:06:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:23,095 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-08 14:06:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:23,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:06:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:23,099 INFO L225 Difference]: With dead ends: 290 [2019-01-08 14:06:23,099 INFO L226 Difference]: Without dead ends: 286 [2019-01-08 14:06:23,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-08 14:06:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-08 14:06:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-08 14:06:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-08 14:06:23,405 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-08 14:06:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:23,405 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-08 14:06:23,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-08 14:06:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:23,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:23,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:23,407 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-08 14:06:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:23,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:23,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:23,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:23,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:23,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:23,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:23,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:23,546 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:23,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:23,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:23,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:23,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:23,565 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 18 treesize of output 21 [2019-01-08 14:06:23,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, 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 23 [2019-01-08 14:06:23,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:06:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:06:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:06:23,614 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:23,678 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-08 14:06:23,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,709 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:06:23,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:23,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:23,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:23,749 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-08 14:06:23,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:23,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:23,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:06:23,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:23,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:23,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:23,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:23,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:23,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:23,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:23,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:23,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:23,873 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-08 14:06:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:24,513 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-08 14:06:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:24,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:24,516 INFO L225 Difference]: With dead ends: 307 [2019-01-08 14:06:24,516 INFO L226 Difference]: Without dead ends: 302 [2019-01-08 14:06:24,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-08 14:06:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-08 14:06:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-08 14:06:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-08 14:06:24,802 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-08 14:06:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:24,802 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-08 14:06:24,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-08 14:06:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:24,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:24,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:24,803 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-08 14:06:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:24,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:24,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:25,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:25,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:25,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:25,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:25,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:25,025 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:25,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:06:25,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:06:25,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:06:25,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:25,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:25,041 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 18 treesize of output 21 [2019-01-08 14:06:25,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,045 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 21 treesize of output 27 [2019-01-08 14:06:25,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-08 14:06:25,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,060 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 25 treesize of output 51 [2019-01-08 14:06:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,067 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:25,067 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,146 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:25,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,184 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 36 treesize of output 72 [2019-01-08 14:06:25,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:25,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:25,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,261 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:25,262 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 36 treesize of output 80 [2019-01-08 14:06:25,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:25,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:25,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,344 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:25,345 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 36 treesize of output 80 [2019-01-08 14:06:25,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:25,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:25,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:25,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:25,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,511 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:25,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:25,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:06:25,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:25,560 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-08 14:06:25,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:25,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:25,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:25,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-08 14:06:25,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:25,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:06:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:06:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:25,695 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-08 14:06:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:26,988 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-08 14:06:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:26,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-08 14:06:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:26,992 INFO L225 Difference]: With dead ends: 284 [2019-01-08 14:06:26,992 INFO L226 Difference]: Without dead ends: 279 [2019-01-08 14:06:26,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:06:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-08 14:06:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-08 14:06:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-08 14:06:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-08 14:06:27,286 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-08 14:06:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:27,286 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-08 14:06:27,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:06:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-08 14:06:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:27,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:27,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:27,287 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:27,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-08 14:06:27,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:27,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:27,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:27,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:27,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:27,342 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-08 14:06:27,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:27,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:27,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:27,343 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-08 14:06:27,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:27,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:27,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:27,347 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:27,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:27,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:27,348 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:27,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:27,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:27,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:27,369 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 18 treesize of output 21 [2019-01-08 14:06:27,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,374 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 21 treesize of output 27 [2019-01-08 14:06:27,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,380 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 23 treesize of output 37 [2019-01-08 14:06:27,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,391 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 25 treesize of output 51 [2019-01-08 14:06:27,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,401 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:27,401 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:27,491 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:27,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,520 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 36 treesize of output 72 [2019-01-08 14:06:27,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,562 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-08 14:06:27,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:27,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:27,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:27,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:27,642 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-08 14:06:27,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:27,661 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-08 14:06:27,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:27,673 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-08 14:06:27,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:27,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:06:27,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:27,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:06:27,692 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-08 14:06:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:28,246 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-08 14:06:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:06:28,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-08 14:06:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:28,249 INFO L225 Difference]: With dead ends: 230 [2019-01-08 14:06:28,249 INFO L226 Difference]: Without dead ends: 223 [2019-01-08 14:06:28,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-08 14:06:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-08 14:06:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-08 14:06:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-08 14:06:28,576 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-08 14:06:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:28,576 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-08 14:06:28,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-08 14:06:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:28,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:28,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:28,577 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-08 14:06:28,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:28,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:28,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:29,044 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-08 14:06:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:29,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:29,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:29,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:29,063 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-08 14:06:29,066 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:29,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:29,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:29,068 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:29,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:29,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:29,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:29,073 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:29,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:29,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:29,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:29,093 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 18 treesize of output 21 [2019-01-08 14:06:29,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,096 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 21 treesize of output 27 [2019-01-08 14:06:29,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,100 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 23 treesize of output 37 [2019-01-08 14:06:29,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,106 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 25 treesize of output 51 [2019-01-08 14:06:29,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,114 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:29,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:29,193 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:29,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,235 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 36 treesize of output 72 [2019-01-08 14:06:29,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:29,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:29,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:29,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,356 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-08 14:06:29,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:29,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:29,391 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:29,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-08 14:06:29,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:29,441 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-08 14:06:29,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:29,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-08 14:06:29,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:29,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:06:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:06:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:06:29,499 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-08 14:06:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:30,211 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-08 14:06:30,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:30,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-08 14:06:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:30,214 INFO L225 Difference]: With dead ends: 254 [2019-01-08 14:06:30,215 INFO L226 Difference]: Without dead ends: 253 [2019-01-08 14:06:30,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-08 14:06:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-08 14:06:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-08 14:06:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-08 14:06:30,554 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-08 14:06:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:30,554 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-08 14:06:30,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:06:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-08 14:06:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:30,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:30,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:30,555 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:30,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-08 14:06:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:30,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:30,865 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-08 14:06:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:30,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:30,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:30,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:30,878 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-08 14:06:30,879 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:30,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:30,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:30,881 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:30,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:30,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:30,882 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:30,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:30,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:30,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:30,898 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 18 treesize of output 21 [2019-01-08 14:06:30,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,900 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 21 treesize of output 27 [2019-01-08 14:06:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,905 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 23 treesize of output 37 [2019-01-08 14:06:30,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,910 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 25 treesize of output 51 [2019-01-08 14:06:30,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:30,918 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:30,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:30,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:30,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:30,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:30,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:30,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:30,995 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:31,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,024 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 36 treesize of output 72 [2019-01-08 14:06:31,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:31,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:31,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:31,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:31,098 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:31,099 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 36 treesize of output 80 [2019-01-08 14:06:31,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:31,141 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-08 14:06:31,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:31,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:31,180 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-08 14:06:31,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:31,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:06:31,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:31,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:06:31,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:06:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:06:31,199 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-08 14:06:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:31,696 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-08 14:06:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:31,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 14:06:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:31,698 INFO L225 Difference]: With dead ends: 223 [2019-01-08 14:06:31,698 INFO L226 Difference]: Without dead ends: 216 [2019-01-08 14:06:31,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:06:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-08 14:06:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-08 14:06:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-08 14:06:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-08 14:06:32,033 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-08 14:06:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:32,033 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-08 14:06:32,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:06:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-08 14:06:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:32,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:32,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:32,034 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-08 14:06:32,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:32,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:32,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:32,196 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-08 14:06:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:32,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:32,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:32,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:32,302 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:06:32,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:06:32,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:06:32,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:32,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:32,321 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 18 treesize of output 21 [2019-01-08 14:06:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,323 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 21 treesize of output 27 [2019-01-08 14:06:32,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,328 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 23 treesize of output 37 [2019-01-08 14:06:32,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,334 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 25 treesize of output 51 [2019-01-08 14:06:32,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,340 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:32,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:32,421 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:32,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,456 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 36 treesize of output 72 [2019-01-08 14:06:32,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:32,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:32,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:06:32,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:32,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:32,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:32,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:06:32,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:32,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:32,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:32,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:06:32,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,761 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-08 14:06:32,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:32,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:32,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:06:32,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:32,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:06:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:06:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:06:32,877 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-08 14:06:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:34,018 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-08 14:06:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:34,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-08 14:06:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:34,022 INFO L225 Difference]: With dead ends: 285 [2019-01-08 14:06:34,022 INFO L226 Difference]: Without dead ends: 279 [2019-01-08 14:06:34,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:06:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-08 14:06:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-08 14:06:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-08 14:06:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-08 14:06:34,334 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-08 14:06:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:34,334 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-08 14:06:34,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:06:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-08 14:06:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:34,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:34,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:34,335 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-08 14:06:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:34,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:34,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:34,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:34,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:34,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:34,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:34,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:34,434 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:34,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:34,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:34,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:34,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:34,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:34,456 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 18 treesize of output 21 [2019-01-08 14:06:34,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,463 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 21 treesize of output 27 [2019-01-08 14:06:34,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,468 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 23 treesize of output 37 [2019-01-08 14:06:34,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,479 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 25 treesize of output 51 [2019-01-08 14:06:34,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,577 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:34,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:34,653 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:34,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,686 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 36 treesize of output 72 [2019-01-08 14:06:34,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:34,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:34,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,760 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:34,761 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 36 treesize of output 80 [2019-01-08 14:06:34,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:34,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:34,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:34,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,884 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-08 14:06:34,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:34,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:34,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:34,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:34,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:34,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:34,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:34,957 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-08 14:06:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:35,765 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-08 14:06:35,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:35,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:35,769 INFO L225 Difference]: With dead ends: 252 [2019-01-08 14:06:35,770 INFO L226 Difference]: Without dead ends: 247 [2019-01-08 14:06:35,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-08 14:06:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-08 14:06:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-08 14:06:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-08 14:06:36,056 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-08 14:06:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:36,056 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-08 14:06:36,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-08 14:06:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:36,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:36,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:36,057 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:36,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:36,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-08 14:06:36,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:36,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:36,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:36,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:36,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:36,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:36,130 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-08 14:06:36,131 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:36,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:36,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:36,134 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:36,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:36,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:36,135 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:36,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:36,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:36,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:36,167 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 18 treesize of output 21 [2019-01-08 14:06:36,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,171 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 21 treesize of output 27 [2019-01-08 14:06:36,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,179 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 23 treesize of output 37 [2019-01-08 14:06:36,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,187 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 25 treesize of output 51 [2019-01-08 14:06:36,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,196 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:36,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,223 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:36,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:36,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,307 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 36 treesize of output 72 [2019-01-08 14:06:36,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:36,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:36,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:36,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:06:36,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:36,426 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-08 14:06:36,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:36,447 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-08 14:06:36,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:36,469 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-08 14:06:36,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:36,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:06:36,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:36,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:06:36,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:06:36,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:06:36,489 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-08 14:06:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:37,009 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-08 14:06:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:37,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 14:06:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:37,011 INFO L225 Difference]: With dead ends: 194 [2019-01-08 14:06:37,011 INFO L226 Difference]: Without dead ends: 193 [2019-01-08 14:06:37,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:06:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-08 14:06:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-08 14:06:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-08 14:06:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-08 14:06:37,323 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-08 14:06:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:37,323 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-08 14:06:37,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:06:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-08 14:06:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:37,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:37,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:37,324 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-08 14:06:37,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:37,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:37,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:37,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:37,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:37,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:37,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:37,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:37,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:37,448 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:37,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:37,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:37,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:37,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:37,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:37,466 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 18 treesize of output 21 [2019-01-08 14:06:37,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:37,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:06:37,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:06:37,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:06:37,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:37,577 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:06:37,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:06:37,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:37,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:37,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:06:37,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:37,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:37,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,729 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:37,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:37,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-08 14:06:37,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:37,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:37,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:06:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:37,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:37,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:37,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:37,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:37,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:37,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:37,832 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-08 14:06:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:38,698 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-08 14:06:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:38,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-08 14:06:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:38,699 INFO L225 Difference]: With dead ends: 265 [2019-01-08 14:06:38,699 INFO L226 Difference]: Without dead ends: 264 [2019-01-08 14:06:38,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-08 14:06:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-08 14:06:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-08 14:06:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-08 14:06:39,052 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-08 14:06:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:39,052 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-08 14:06:39,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-08 14:06:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:39,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:39,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:39,053 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-08 14:06:39,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:39,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:39,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:39,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:39,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:39,145 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:39,145 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-08 14:06:39,146 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:39,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:39,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:39,147 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:39,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:39,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:39,148 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:39,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:39,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:39,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:39,165 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 18 treesize of output 21 [2019-01-08 14:06:39,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:39,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:06:39,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:06:39,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:06:39,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:39,258 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-08 14:06:39,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,372 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-08 14:06:39,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:39,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:39,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:39,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:39,407 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-08 14:06:39,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:39,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:39,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:39,439 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-08 14:06:39,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:39,460 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-08 14:06:39,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:39,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:06:39,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:39,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:06:39,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:06:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:06:39,479 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-08 14:06:39,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:39,996 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-08 14:06:39,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:39,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 14:06:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:39,998 INFO L225 Difference]: With dead ends: 210 [2019-01-08 14:06:39,998 INFO L226 Difference]: Without dead ends: 203 [2019-01-08 14:06:39,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:06:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-08 14:06:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-08 14:06:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-08 14:06:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-08 14:06:40,400 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-08 14:06:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:40,400 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-08 14:06:40,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:06:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-08 14:06:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:06:40,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:40,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:40,401 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-08 14:06:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:40,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:40,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:40,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:40,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:40,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:40,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-08 14:06:40,488 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-08 14:06:40,488 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:40,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:40,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:40,490 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 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-08 14:06:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:40,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:40,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:40,491 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:40,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:40,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:40,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:40,507 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 18 treesize of output 21 [2019-01-08 14:06:40,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-08 14:06:40,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:06:40,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:06:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:06:40,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,556 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:40,603 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:06:40,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:06:40,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:40,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:40,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:06:40,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:40,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:40,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:06:40,751 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-08 14:06:40,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:41,101 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-08 14:06:41,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:41,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:06:41,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:41,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:06:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:06:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:06:41,133 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-08 14:06:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:41,819 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-08 14:06:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:41,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 14:06:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:41,820 INFO L225 Difference]: With dead ends: 216 [2019-01-08 14:06:41,821 INFO L226 Difference]: Without dead ends: 212 [2019-01-08 14:06:41,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:06:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-08 14:06:42,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-08 14:06:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-08 14:06:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-08 14:06:42,231 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-08 14:06:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:42,231 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-08 14:06:42,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:06:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-08 14:06:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:42,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:42,232 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:42,232 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-08 14:06:42,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:42,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:42,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:42,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:42,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:42,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:42,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:42,331 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:42,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:42,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:42,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:06:42,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:42,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:42,353 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 18 treesize of output 21 [2019-01-08 14:06:42,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,359 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 21 treesize of output 27 [2019-01-08 14:06:42,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,364 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 23 treesize of output 37 [2019-01-08 14:06:42,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,370 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 25 treesize of output 51 [2019-01-08 14:06:42,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,380 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:42,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:42,459 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:42,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,488 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 36 treesize of output 66 [2019-01-08 14:06:42,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:42,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:42,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-08 14:06:42,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:42,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:42,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:42,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:06:42,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:42,684 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-08 14:06:42,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:42,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:42,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:06:42,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:42,745 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-08 14:06:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:43,880 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-08 14:06:43,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:43,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:06:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:43,883 INFO L225 Difference]: With dead ends: 401 [2019-01-08 14:06:43,883 INFO L226 Difference]: Without dead ends: 397 [2019-01-08 14:06:43,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-08 14:06:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-08 14:06:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-08 14:06:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-08 14:06:44,612 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-08 14:06:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:44,612 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-08 14:06:44,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-08 14:06:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:44,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:44,613 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:44,613 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-08 14:06:44,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:44,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:44,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:44,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:06:44,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:06:44,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:06:44,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:06:44,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:06:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:06:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:06:44,712 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-08 14:06:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:45,435 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-08 14:06:45,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:06:45,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-08 14:06:45,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:45,437 INFO L225 Difference]: With dead ends: 347 [2019-01-08 14:06:45,437 INFO L226 Difference]: Without dead ends: 342 [2019-01-08 14:06:45,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:06:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-08 14:06:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-08 14:06:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-08 14:06:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-08 14:06:46,096 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-08 14:06:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:46,096 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-08 14:06:46,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:06:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-08 14:06:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:46,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:46,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:46,098 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:46,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-08 14:06:46,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:46,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:46,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:46,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:46,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:46,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:46,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:46,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:06:46,294 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-08 14:06:46,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:46,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:46,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:46,297 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-08 14:06:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:46,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:46,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:46,297 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:46,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:46,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:46,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:46,314 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 18 treesize of output 21 [2019-01-08 14:06:46,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,318 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 21 treesize of output 27 [2019-01-08 14:06:46,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,329 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 23 treesize of output 37 [2019-01-08 14:06:46,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,335 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 25 treesize of output 51 [2019-01-08 14:06:46,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,345 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:46,346 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,561 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:46,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,596 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 36 treesize of output 66 [2019-01-08 14:06:46,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:46,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:46,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:06:46,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:46,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:46,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:46,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:06:46,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:46,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:46,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:46,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:06:46,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,905 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-08 14:06:46,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:46,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,946 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:46,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:06:46,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:46,996 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-08 14:06:46,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:47,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:47,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:47,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-08 14:06:47,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:47,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:06:47,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:06:47,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:06:47,100 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-08 14:06:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:48,972 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-08 14:06:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:48,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-08 14:06:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:48,975 INFO L225 Difference]: With dead ends: 471 [2019-01-08 14:06:48,975 INFO L226 Difference]: Without dead ends: 470 [2019-01-08 14:06:48,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:06:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-08 14:06:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-08 14:06:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-08 14:06:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-08 14:06:49,762 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-08 14:06:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:49,762 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-08 14:06:49,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:06:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-08 14:06:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:49,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:49,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:49,763 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-08 14:06:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:49,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:49,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:49,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:49,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:49,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:49,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:49,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:49,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:49,953 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:06:49,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:06:49,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:06:49,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:49,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:49,974 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 18 treesize of output 21 [2019-01-08 14:06:49,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,978 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 21 treesize of output 27 [2019-01-08 14:06:49,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,984 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 23 treesize of output 37 [2019-01-08 14:06:49,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,992 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 25 treesize of output 51 [2019-01-08 14:06:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:49,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,002 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:50,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,085 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:50,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,121 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 36 treesize of output 66 [2019-01-08 14:06:50,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:50,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:50,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:06:50,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:50,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:50,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:50,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:06:50,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:50,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:50,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,374 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:50,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:06:50,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:50,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:50,464 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:50,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:06:50,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:50,508 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-08 14:06:50,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:50,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:50,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:50,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-08 14:06:50,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:50,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:06:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:06:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:06:50,634 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-08 14:06:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:52,433 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-08 14:06:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:06:52,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-08 14:06:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:52,437 INFO L225 Difference]: With dead ends: 483 [2019-01-08 14:06:52,437 INFO L226 Difference]: Without dead ends: 482 [2019-01-08 14:06:52,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:06:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-08 14:06:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-08 14:06:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-08 14:06:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-08 14:06:53,212 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-08 14:06:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:53,212 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-08 14:06:53,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:06:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-08 14:06:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:53,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:53,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:53,213 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-08 14:06:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:53,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:06:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:53,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:53,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:53,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:53,340 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:06:53,341 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-08 14:06:53,341 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:53,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:53,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:53,343 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:53,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:53,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:53,344 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:53,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:53,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:53,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 18 treesize of output 21 [2019-01-08 14:06:53,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:06:53,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:06:53,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:06:53,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:06:53,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:53,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-08 14:06:53,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,666 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:06:53,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-08 14:06:53,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-08 14:06:53,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:53,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-08 14:06:53,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:53,742 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:53,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-08 14:06:53,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:53,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:53,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:06:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:53,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:53,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:53,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:53,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:53,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:53,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:53,835 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-08 14:06:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:54,892 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-08 14:06:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:54,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:06:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:54,894 INFO L225 Difference]: With dead ends: 400 [2019-01-08 14:06:54,894 INFO L226 Difference]: Without dead ends: 393 [2019-01-08 14:06:54,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-08 14:06:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-08 14:06:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-08 14:06:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-08 14:06:55,710 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-08 14:06:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:55,711 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-08 14:06:55,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-08 14:06:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:55,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:55,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:55,712 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-08 14:06:55,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:55,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:55,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:06:55,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:55,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:55,833 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:06:55,833 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-08 14:06:55,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:55,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:55,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:55,835 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:06:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:55,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:55,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:55,836 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:55,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:55,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:55,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:55,852 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 18 treesize of output 21 [2019-01-08 14:06:55,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,856 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 21 treesize of output 27 [2019-01-08 14:06:55,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,861 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 23 treesize of output 37 [2019-01-08 14:06:55,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,870 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 25 treesize of output 51 [2019-01-08 14:06:55,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,886 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:55,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:55,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:55,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:55,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:55,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:55,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:55,965 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:55,999 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 36 treesize of output 66 [2019-01-08 14:06:56,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:56,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:56,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:56,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:06:56,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:56,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:56,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:56,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:56,159 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:56,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:06:56,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:56,208 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-08 14:06:56,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:56,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:56,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:56,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:06:56,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:56,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:06:56,286 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-08 14:06:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:57,456 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-08 14:06:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:06:57,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:06:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:57,458 INFO L225 Difference]: With dead ends: 409 [2019-01-08 14:06:57,458 INFO L226 Difference]: Without dead ends: 397 [2019-01-08 14:06:57,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:06:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-08 14:06:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-08 14:06:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-08 14:06:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-08 14:06:58,275 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-08 14:06:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:58,275 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-08 14:06:58,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-08 14:06:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:06:58,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:58,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:06:58,277 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-08 14:06:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:58,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:58,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:58,475 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-08 14:06:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:58,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:58,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:58,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:06:58,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:06:58,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:58,629 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:06:58,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:06:58,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:06:58,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:06:58,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:06:58,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:58,646 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 18 treesize of output 21 [2019-01-08 14:06:58,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,653 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 21 treesize of output 27 [2019-01-08 14:06:58,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,659 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 23 treesize of output 37 [2019-01-08 14:06:58,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,667 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 25 treesize of output 51 [2019-01-08 14:06:58,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,674 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:06:58,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,768 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:06:58,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,805 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 36 treesize of output 66 [2019-01-08 14:06:58,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:58,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:58,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:06:58,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:58,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:58,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:06:58,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,967 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:58,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:58,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:06:58,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:59,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-08 14:06:59,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,062 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:59,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:06:59,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:59,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:59,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:59,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:59,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:06:59,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:59,209 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-08 14:06:59,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:06:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:59,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:59,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:59,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-08 14:06:59,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:59,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:06:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:06:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:06:59,352 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-08 14:07:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:01,433 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-08 14:07:01,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:07:01,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-08 14:07:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:01,436 INFO L225 Difference]: With dead ends: 542 [2019-01-08 14:07:01,436 INFO L226 Difference]: Without dead ends: 536 [2019-01-08 14:07:01,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:07:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-08 14:07:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-08 14:07:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-08 14:07:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-08 14:07:02,397 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-08 14:07:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:02,397 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-08 14:07:02,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:07:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-08 14:07:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:02,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:02,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:02,398 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-08 14:07:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:02,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:02,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:02,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:02,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:02,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:02,526 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-08 14:07:02,527 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:02,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:02,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:02,528 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:07:02,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:02,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:02,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:02,529 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:02,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:02,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:02,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:02,546 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 18 treesize of output 21 [2019-01-08 14:07:02,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,548 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 21 treesize of output 27 [2019-01-08 14:07:02,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,555 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 23 treesize of output 37 [2019-01-08 14:07:02,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,560 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 25 treesize of output 51 [2019-01-08 14:07:02,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:02,567 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:02,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:02,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,679 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 36 treesize of output 66 [2019-01-08 14:07:02,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:02,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:02,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:07:02,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:02,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:07:02,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,838 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:02,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-08 14:07:02,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,889 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-08 14:07:02,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:07:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:02,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:07:02,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:02,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:07:02,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:07:02,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:02,963 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-08 14:07:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:04,378 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-08 14:07:04,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:07:04,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:07:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:04,380 INFO L225 Difference]: With dead ends: 469 [2019-01-08 14:07:04,380 INFO L226 Difference]: Without dead ends: 465 [2019-01-08 14:07:04,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:07:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-08 14:07:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-08 14:07:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-08 14:07:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-08 14:07:05,429 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-08 14:07:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:05,430 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-08 14:07:05,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:07:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-08 14:07:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:05,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:05,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:05,431 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-08 14:07:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:05,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:05,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:05,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:05,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:05,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:05,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:05,690 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:05,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:05,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:05,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:05,712 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 18 treesize of output 21 [2019-01-08 14:07:05,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,714 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 21 treesize of output 27 [2019-01-08 14:07:05,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-08 14:07:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,732 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 25 treesize of output 51 [2019-01-08 14:07:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,742 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:05,742 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,769 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,820 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:05,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,859 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 36 treesize of output 66 [2019-01-08 14:07:05,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:05,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:05,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:05,938 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:05,939 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 38 treesize of output 81 [2019-01-08 14:07:05,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:05,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:05,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-08 14:07:06,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-08 14:07:06,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:06,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:06,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-08 14:07:06,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,110 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:06,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:07:06,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:06,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:06,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:07:06,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:06,205 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:06,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:07:06,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:06,253 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-08 14:07:06,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:07:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:06,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:06,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:06,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-08 14:07:06,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:06,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:07:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:07:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:07:06,406 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-08 14:07:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:08,282 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-08 14:07:08,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:07:08,282 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-08 14:07:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:08,284 INFO L225 Difference]: With dead ends: 481 [2019-01-08 14:07:08,285 INFO L226 Difference]: Without dead ends: 480 [2019-01-08 14:07:08,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:07:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-08 14:07:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-08 14:07:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-08 14:07:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-08 14:07:08,821 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-08 14:07:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:08,822 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-08 14:07:08,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:07:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-08 14:07:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:08,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:08,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:08,823 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-08 14:07:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:08,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:08,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:08,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:08,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:08,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:08,908 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-08 14:07:08,909 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:08,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:08,911 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:08,911 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 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-08 14:07:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:08,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:08,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:08,912 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:08,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:08,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:08,931 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 18 treesize of output 21 [2019-01-08 14:07:08,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:08,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:07:08,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:08,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-08 14:07:08,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:08,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:08,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-08 14:07:08,961 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:08,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:08,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:08,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:09,020 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-08 14:07:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,049 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-08 14:07:09,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:09,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-08 14:07:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:09,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-08 14:07:09,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:09,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:09,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-08 14:07:09,120 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-08 14:07:09,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:09,142 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-08 14:07:09,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:07:09,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:09,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:07:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:07:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:07:09,162 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-08 14:07:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:09,918 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-08 14:07:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:07:09,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-08 14:07:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:09,920 INFO L225 Difference]: With dead ends: 267 [2019-01-08 14:07:09,920 INFO L226 Difference]: Without dead ends: 258 [2019-01-08 14:07:09,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-08 14:07:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-08 14:07:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-08 14:07:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-08 14:07:10,467 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-08 14:07:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:10,467 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-08 14:07:10,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:07:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-08 14:07:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:10,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:10,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:10,468 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-08 14:07:10,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:10,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:10,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:10,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:10,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:10,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:10,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:10,663 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-08 14:07:10,664 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:10,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:10,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:10,667 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:07:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:10,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:10,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:10,668 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:10,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:10,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:10,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:10,684 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 18 treesize of output 21 [2019-01-08 14:07:10,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,691 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 21 treesize of output 27 [2019-01-08 14:07:10,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,696 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 23 treesize of output 37 [2019-01-08 14:07:10,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,705 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 25 treesize of output 51 [2019-01-08 14:07:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,714 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:10,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,796 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,832 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 36 treesize of output 72 [2019-01-08 14:07:10,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:10,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:10,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:07:10,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:10,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:10,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:10,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:10,994 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:10,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:07:10,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:11,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:11,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:07:11,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,081 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:11,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:11,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:07:11,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:11,131 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-08 14:07:11,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:07:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:11,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:11,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:11,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:07:11,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:11,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:07:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:07:11,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:11,250 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-08 14:07:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:12,559 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-08 14:07:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:07:12,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:07:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:12,563 INFO L225 Difference]: With dead ends: 309 [2019-01-08 14:07:12,563 INFO L226 Difference]: Without dead ends: 306 [2019-01-08 14:07:12,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:07:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-08 14:07:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-08 14:07:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-08 14:07:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-08 14:07:13,353 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-08 14:07:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:13,353 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-08 14:07:13,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:07:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-08 14:07:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:13,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:13,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:13,354 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:13,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:13,354 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-08 14:07:13,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:13,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:13,443 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-08 14:07:13,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:13,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:13,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:13,444 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-08 14:07:13,445 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:13,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:13,447 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:13,447 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 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-08 14:07:13,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:13,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:13,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:13,448 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:13,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:13,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:13,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:13,470 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 18 treesize of output 21 [2019-01-08 14:07:13,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:13,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-08 14:07:13,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-08 14:07:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-08 14:07:13,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:13,578 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-08 14:07:13,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-08 14:07:13,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-08 14:07:13,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-08 14:07:13,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:13,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-08 14:07:13,644 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-08 14:07:13,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:13,658 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-08 14:07:13,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:13,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-08 14:07:13,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:13,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:07:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:07:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:07:13,677 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-08 14:07:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:14,963 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-08 14:07:14,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:07:14,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:07:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:14,965 INFO L225 Difference]: With dead ends: 379 [2019-01-08 14:07:14,965 INFO L226 Difference]: Without dead ends: 366 [2019-01-08 14:07:14,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:07:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-08 14:07:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-08 14:07:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-08 14:07:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-08 14:07:15,809 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-08 14:07:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:15,809 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-08 14:07:15,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:07:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-08 14:07:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:15,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:15,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:15,810 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:15,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-08 14:07:15,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:15,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:15,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:15,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:15,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:15,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:15,960 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:15,960 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-08 14:07:15,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:15,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:15,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:15,962 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:07:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:15,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:15,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:15,963 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:15,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:15,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:15,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:15,979 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 18 treesize of output 21 [2019-01-08 14:07:15,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:15,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:07:15,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:07:16,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:07:16,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,131 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:07:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:07:16,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:16,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:07:16,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:16,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,285 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:16,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:07:16,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:07:16,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,349 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:16,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:07:16,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:07:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:16,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:16,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:16,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-08 14:07:16,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:16,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:07:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:07:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:16,466 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-08 14:07:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:18,329 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-08 14:07:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:07:18,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-08 14:07:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:18,331 INFO L225 Difference]: With dead ends: 371 [2019-01-08 14:07:18,331 INFO L226 Difference]: Without dead ends: 366 [2019-01-08 14:07:18,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:07:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-08 14:07:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-08 14:07:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-08 14:07:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-08 14:07:19,288 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-08 14:07:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:19,288 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-08 14:07:19,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:07:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-08 14:07:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:19,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:19,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:19,289 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-08 14:07:19,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:19,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:19,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:19,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:19,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:19,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:19,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:19,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:19,413 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-08 14:07:19,414 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:19,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:19,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:19,416 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:07:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:19,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:19,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:19,416 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:19,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:19,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:19,432 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 18 treesize of output 21 [2019-01-08 14:07:19,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,439 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 21 treesize of output 27 [2019-01-08 14:07:19,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,445 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 23 treesize of output 37 [2019-01-08 14:07:19,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,457 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 25 treesize of output 51 [2019-01-08 14:07:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:19,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:19,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,581 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 36 treesize of output 72 [2019-01-08 14:07:19,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:19,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,664 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:19,664 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 36 treesize of output 80 [2019-01-08 14:07:19,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:19,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:19,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:07:19,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,792 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-08 14:07:19,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:19,831 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:19,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:07:19,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:19,879 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-08 14:07:19,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:07:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:19,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:19,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:19,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:07:19,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:19,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:07:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:07:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:19,971 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-08 14:07:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:21,608 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-08 14:07:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:21,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:07:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:21,610 INFO L225 Difference]: With dead ends: 285 [2019-01-08 14:07:21,610 INFO L226 Difference]: Without dead ends: 284 [2019-01-08 14:07:21,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:07:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-08 14:07:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-08 14:07:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-08 14:07:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-08 14:07:22,591 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-08 14:07:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:22,591 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-08 14:07:22,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:07:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-08 14:07:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:22,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:22,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:22,592 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-08 14:07:22,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:22,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:22,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:22,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:22,889 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-08 14:07:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:22,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:22,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:22,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:22,938 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-08 14:07:22,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:22,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:22,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:22,940 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:07:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:22,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:22,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:22,941 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:22,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:22,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:22,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:22,958 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 18 treesize of output 21 [2019-01-08 14:07:22,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,961 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 21 treesize of output 27 [2019-01-08 14:07:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,965 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 23 treesize of output 37 [2019-01-08 14:07:22,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,970 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 25 treesize of output 51 [2019-01-08 14:07:22,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:22,976 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:22,976 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:23,055 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:23,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,089 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 36 treesize of output 72 [2019-01-08 14:07:23,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:23,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:23,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,162 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:23,162 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 36 treesize of output 80 [2019-01-08 14:07:23,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:23,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:23,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:23,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:07:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:23,287 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-08 14:07:23,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:23,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:23,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:23,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:07:23,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:23,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:07:23,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:07:23,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:23,368 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-08 14:07:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:24,853 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-08 14:07:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:24,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:07:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:24,854 INFO L225 Difference]: With dead ends: 281 [2019-01-08 14:07:24,854 INFO L226 Difference]: Without dead ends: 274 [2019-01-08 14:07:24,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-08 14:07:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-08 14:07:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-08 14:07:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-08 14:07:25,974 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-08 14:07:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:25,974 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-08 14:07:25,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:07:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-08 14:07:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:25,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:25,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:25,975 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-08 14:07:25,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:25,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:25,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:26,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:26,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:26,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:26,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:26,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:26,163 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:26,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:07:26,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:07:26,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:07:26,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:26,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:26,181 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 18 treesize of output 21 [2019-01-08 14:07:26,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,185 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 21 treesize of output 27 [2019-01-08 14:07:26,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,190 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 23 treesize of output 37 [2019-01-08 14:07:26,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,196 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 25 treesize of output 51 [2019-01-08 14:07:26,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,204 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:26,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:26,284 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,320 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 36 treesize of output 72 [2019-01-08 14:07:26,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:26,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:26,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,394 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:26,395 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 36 treesize of output 80 [2019-01-08 14:07:26,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:26,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:26,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,490 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:26,490 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 36 treesize of output 80 [2019-01-08 14:07:26,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:26,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:26,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:07:26,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:26,617 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-08 14:07:26,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:26,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:26,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:26,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:07:26,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:26,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:07:26,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:07:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:26,729 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-08 14:07:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:28,623 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-08 14:07:28,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:28,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-08 14:07:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:28,625 INFO L225 Difference]: With dead ends: 295 [2019-01-08 14:07:28,625 INFO L226 Difference]: Without dead ends: 288 [2019-01-08 14:07:28,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:07:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-08 14:07:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-08 14:07:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-08 14:07:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-08 14:07:29,809 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-08 14:07:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:29,810 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-08 14:07:29,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:07:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-08 14:07:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:29,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:29,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:29,810 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-08 14:07:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:29,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:29,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:30,020 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-08 14:07:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:30,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:30,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:30,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:30,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:30,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:30,096 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:07:30,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:07:30,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:07:30,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:30,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:30,114 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 18 treesize of output 21 [2019-01-08 14:07:30,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:30,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:07:30,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:07:30,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:07:30,141 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,160 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:30,205 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:07:30,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:07:30,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:30,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:30,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:07:30,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:30,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:30,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,365 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:30,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:07:30,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:30,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:07:30,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:30,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:30,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-08 14:07:30,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:30,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:30,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:07:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:30,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:30,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:30,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:07:30,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:30,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:07:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:07:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:30,555 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-08 14:07:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:32,724 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-08 14:07:32,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:32,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-08 14:07:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:32,725 INFO L225 Difference]: With dead ends: 370 [2019-01-08 14:07:32,725 INFO L226 Difference]: Without dead ends: 363 [2019-01-08 14:07:32,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:07:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-08 14:07:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-08 14:07:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-08 14:07:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-08 14:07:33,995 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-08 14:07:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:33,995 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-08 14:07:33,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:07:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-08 14:07:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:33,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:33,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:33,996 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-08 14:07:33,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:33,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:33,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:34,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:34,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:34,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:34,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:34,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:34,177 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:34,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:07:34,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:07:34,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:07:34,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:34,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:34,213 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 18 treesize of output 21 [2019-01-08 14:07:34,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:34,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:07:34,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:07:34,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:07:34,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:34,301 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:07:34,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:07:34,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:34,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:34,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,402 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:34,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:07:34,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:34,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:34,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-08 14:07:34,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:34,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:34,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,517 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:34,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:34,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:07:34,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:34,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:34,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:07:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:34,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:34,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:34,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:07:34,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:34,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:07:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:07:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:34,646 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-08 14:07:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:36,669 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-08 14:07:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:36,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-08 14:07:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:36,670 INFO L225 Difference]: With dead ends: 349 [2019-01-08 14:07:36,670 INFO L226 Difference]: Without dead ends: 344 [2019-01-08 14:07:36,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:07:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-08 14:07:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-08 14:07:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-08 14:07:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-08 14:07:37,772 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-08 14:07:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:37,772 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-08 14:07:37,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:07:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-08 14:07:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:37,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:37,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:37,773 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:37,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-08 14:07:37,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:37,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:37,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:37,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:37,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:37,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:37,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:37,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:37,888 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-08 14:07:37,889 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:37,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:37,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:37,890 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:07:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:37,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:37,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:37,891 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:37,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:37,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:37,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:37,942 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 18 treesize of output 21 [2019-01-08 14:07:37,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:38,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:07:38,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:07:38,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:07:38,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:38,099 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:07:38,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:07:38,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:38,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:38,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-08 14:07:38,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:38,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:38,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:38,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:07:38,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:38,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:38,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:38,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:38,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:38,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:07:38,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:38,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:07:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:07:38,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:38,359 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-08 14:07:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:39,935 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-08 14:07:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:39,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:07:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:39,937 INFO L225 Difference]: With dead ends: 257 [2019-01-08 14:07:39,937 INFO L226 Difference]: Without dead ends: 250 [2019-01-08 14:07:39,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-08 14:07:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-08 14:07:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-08 14:07:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-08 14:07:41,072 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-08 14:07:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:41,072 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-08 14:07:41,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:07:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-08 14:07:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:41,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:41,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:41,073 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:41,073 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-08 14:07:41,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:41,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:41,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:41,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:41,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:41,203 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-08 14:07:41,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:41,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:41,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:41,205 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:07:41,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:41,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:41,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:41,205 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:41,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:41,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:41,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:41,235 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 18 treesize of output 21 [2019-01-08 14:07:41,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,250 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 21 treesize of output 27 [2019-01-08 14:07:41,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,254 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 23 treesize of output 37 [2019-01-08 14:07:41,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,260 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 25 treesize of output 51 [2019-01-08 14:07:41,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,268 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:41,269 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:41,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:41,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,387 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 36 treesize of output 72 [2019-01-08 14:07:41,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:41,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:41,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:07:41,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:41,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:41,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,561 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:07:41,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,610 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-08 14:07:41,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:07:41,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:41,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:41,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-08 14:07:41,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:41,700 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-08 14:07:41,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:07:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:41,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:41,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:07:41,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:41,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:07:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:07:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:41,803 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-08 14:07:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:43,921 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-08 14:07:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:43,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-08 14:07:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:43,923 INFO L225 Difference]: With dead ends: 316 [2019-01-08 14:07:43,923 INFO L226 Difference]: Without dead ends: 315 [2019-01-08 14:07:43,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:07:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-08 14:07:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-08 14:07:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-08 14:07:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-08 14:07:45,192 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-08 14:07:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:45,192 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-08 14:07:45,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:07:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-08 14:07:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:45,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:45,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:45,193 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-08 14:07:45,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:45,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:45,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:45,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:45,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:45,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:45,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:45,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:45,380 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-08 14:07:45,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:45,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:45,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:45,382 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:07:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:45,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:45,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:45,383 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:45,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:45,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:45,438 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 18 treesize of output 21 [2019-01-08 14:07:45,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,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 21 treesize of output 27 [2019-01-08 14:07:45,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,531 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 23 treesize of output 37 [2019-01-08 14:07:45,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,567 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 25 treesize of output 51 [2019-01-08 14:07:45,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,574 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:45,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:45,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:45,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:45,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:45,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:45,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:45,652 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:45,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,913 INFO L303 Elim1Store]: Index analysis took 241 ms [2019-01-08 14:07:45,913 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 36 treesize of output 72 [2019-01-08 14:07:45,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:45,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:45,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:45,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:45,988 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:45,989 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 36 treesize of output 80 [2019-01-08 14:07:45,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:46,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:46,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:46,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:46,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:46,068 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 36 treesize of output 80 [2019-01-08 14:07:46,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:46,118 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-08 14:07:46,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:46,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:46,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:46,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:07:46,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:46,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:07:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:07:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:46,219 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-08 14:07:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:47,766 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-08 14:07:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:47,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:07:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:47,767 INFO L225 Difference]: With dead ends: 253 [2019-01-08 14:07:47,767 INFO L226 Difference]: Without dead ends: 246 [2019-01-08 14:07:47,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-08 14:07:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-08 14:07:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-08 14:07:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-08 14:07:48,926 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-08 14:07:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:48,926 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-08 14:07:48,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:07:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-08 14:07:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:48,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:48,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:48,927 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:48,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-08 14:07:48,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:48,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:48,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:48,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:07:49,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:49,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:49,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:49,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:49,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:49,099 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:49,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:07:49,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:07:49,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:07:49,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:49,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:49,118 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 18 treesize of output 21 [2019-01-08 14:07:49,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,125 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 21 treesize of output 27 [2019-01-08 14:07:49,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,131 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 23 treesize of output 37 [2019-01-08 14:07:49,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,137 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 25 treesize of output 51 [2019-01-08 14:07:49,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,151 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:49,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:49,229 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:49,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,268 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 36 treesize of output 72 [2019-01-08 14:07:49,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:49,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:49,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:07:49,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:49,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:49,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:07:49,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:49,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:07:49,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:49,533 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:49,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:07:49,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:49,580 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-08 14:07:49,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:07:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:49,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:49,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:49,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:07:49,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:49,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:07:49,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:07:49,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:49,694 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-08 14:07:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:52,036 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-08 14:07:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:07:52,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-08 14:07:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:52,038 INFO L225 Difference]: With dead ends: 332 [2019-01-08 14:07:52,038 INFO L226 Difference]: Without dead ends: 328 [2019-01-08 14:07:52,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:07:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-08 14:07:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-08 14:07:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-08 14:07:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-08 14:07:53,250 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-08 14:07:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:53,250 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-08 14:07:53,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:07:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-08 14:07:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:53,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:53,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:53,251 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-08 14:07:53,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:53,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:53,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:53,961 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-08 14:07:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:07:54,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:54,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:54,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:54,002 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-08 14:07:54,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:54,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:54,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:54,006 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:07:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:54,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:54,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:54,007 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:54,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:54,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:54,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:54,024 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 18 treesize of output 21 [2019-01-08 14:07:54,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,026 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 21 treesize of output 27 [2019-01-08 14:07:54,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,030 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 23 treesize of output 37 [2019-01-08 14:07:54,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,038 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 25 treesize of output 51 [2019-01-08 14:07:54,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,046 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:07:54,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:54,125 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:07:54,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,155 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 36 treesize of output 72 [2019-01-08 14:07:54,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:54,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:54,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:54,234 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 36 treesize of output 80 [2019-01-08 14:07:54,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:54,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:54,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:54,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:07:54,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:54,364 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-08 14:07:54,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:07:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:54,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:54,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:54,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:07:54,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:54,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:07:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:07:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:54,442 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-08 14:07:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:56,046 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-08 14:07:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:56,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-08 14:07:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:56,047 INFO L225 Difference]: With dead ends: 242 [2019-01-08 14:07:56,047 INFO L226 Difference]: Without dead ends: 241 [2019-01-08 14:07:56,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-08 14:07:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-08 14:07:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-08 14:07:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-08 14:07:57,271 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-08 14:07:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:57,271 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-08 14:07:57,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:07:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-08 14:07:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:07:57,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:57,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:07:57,271 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-08 14:07:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:57,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:57,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:57,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:57,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:57,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:57,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:07:57,392 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-08 14:07:57,392 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:57,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:57,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:57,395 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:07:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:57,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:57,396 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 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:07:57,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:57,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:57,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:57,414 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 18 treesize of output 21 [2019-01-08 14:07:57,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:07:57,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:07:57,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:07:57,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:07:57,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:57,518 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:07:57,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:07:57,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:57,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:07:57,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:57,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-08 14:07:57,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:57,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:07:57,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:57,816 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-08 14:07:57,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:07:57,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:57,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:57,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:07:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:57,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:57,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:57,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:07:57,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:57,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:07:57,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:07:57,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:07:57,921 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-08 14:07:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:59,608 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-08 14:07:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:07:59,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:07:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:59,610 INFO L225 Difference]: With dead ends: 254 [2019-01-08 14:07:59,610 INFO L226 Difference]: Without dead ends: 245 [2019-01-08 14:07:59,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-08 14:08:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-08 14:08:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-08 14:08:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-08 14:08:00,798 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-08 14:08:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:00,799 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-08 14:08:00,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:08:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-08 14:08:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:08:00,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:00,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:00,799 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-08 14:08:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:00,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:00,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:00,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:00,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:00,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:08:00,910 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-08 14:08:00,911 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:00,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:00,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:00,912 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:08:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:00,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:00,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:00,913 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:00,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:00,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:00,931 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 18 treesize of output 21 [2019-01-08 14:08:00,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:00,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:00,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:00,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:00,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:00,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:00,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:00,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:00,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:00,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:01,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:01,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:01,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:01,024 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:01,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:08:01,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:01,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:01,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:01,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,124 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:01,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-08 14:08:01,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:01,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:01,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:08:01,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:01,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-08 14:08:01,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:01,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:01,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:08:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:01,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:01,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:01,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:08:01,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:01,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:08:01,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:08:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:08:01,291 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-08 14:08:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:02,907 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-08 14:08:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:08:02,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-08 14:08:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:02,908 INFO L225 Difference]: With dead ends: 249 [2019-01-08 14:08:02,908 INFO L226 Difference]: Without dead ends: 248 [2019-01-08 14:08:02,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:08:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-08 14:08:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-08 14:08:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-08 14:08:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-08 14:08:04,176 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-08 14:08:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:04,176 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-08 14:08:04,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:08:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-08 14:08:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:08:04,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:04,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:04,177 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-08 14:08:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:04,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:04,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:04,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:04,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:04,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:08:04,251 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-08 14:08:04,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:04,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:04,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:04,253 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 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-08 14:08:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:04,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:04,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:04,254 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:04,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:04,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:04,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:04,274 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 18 treesize of output 21 [2019-01-08 14:08:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,276 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 21 treesize of output 27 [2019-01-08 14:08:04,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,282 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 23 treesize of output 37 [2019-01-08 14:08:04,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,290 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 25 treesize of output 51 [2019-01-08 14:08:04,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,297 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:04,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,326 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:04,376 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:04,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,406 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 36 treesize of output 72 [2019-01-08 14:08:04,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:04,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:04,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:04,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-08 14:08:04,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:04,523 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-08 14:08:04,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:04,553 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-08 14:08:04,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:04,650 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-08 14:08:04,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:04,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:08:04,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:04,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:08:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:08:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:08:04,670 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-08 14:08:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:06,182 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-08 14:08:06,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:08:06,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-08 14:08:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:06,183 INFO L225 Difference]: With dead ends: 239 [2019-01-08 14:08:06,183 INFO L226 Difference]: Without dead ends: 230 [2019-01-08 14:08:06,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:08:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-08 14:08:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-08 14:08:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-08 14:08:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-08 14:08:07,420 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-08 14:08:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:07,420 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-08 14:08:07,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:08:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-08 14:08:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:08:07,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:07,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:07,421 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:07,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:07,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-08 14:08:07,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:07,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:07,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:07,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:07,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:07,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:07,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:07,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-08 14:08:07,493 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-08 14:08:07,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:07,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:07,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:07,495 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 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-08 14:08:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:07,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:07,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:07,496 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:07,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:07,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:07,517 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 18 treesize of output 21 [2019-01-08 14:08:07,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:07,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:07,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:07,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:07,626 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:07,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:08:07,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:07,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:07,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:07,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:08:07,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:07,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:07,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:08:07,768 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-08 14:08:07,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:07,786 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-08 14:08:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:07,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-08 14:08:07,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:07,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:08:07,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:08:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:08:07,805 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-08 14:08:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:09,215 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-08 14:08:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:08:09,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-08 14:08:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:09,217 INFO L225 Difference]: With dead ends: 236 [2019-01-08 14:08:09,217 INFO L226 Difference]: Without dead ends: 227 [2019-01-08 14:08:09,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:08:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-08 14:08:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-08 14:08:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-08 14:08:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-08 14:08:10,426 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-08 14:08:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:10,426 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-08 14:08:10,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:08:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-08 14:08:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:10,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:10,427 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:10,427 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-08 14:08:10,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:10,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:10,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:08:10,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:10,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:10,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:10,536 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-08 14:08:10,536 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:10,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:10,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:10,538 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 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-08 14:08:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:10,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:10,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:10,538 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:10,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:10,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:10,554 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 18 treesize of output 21 [2019-01-08 14:08:10,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:10,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:10,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:10,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:10,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:10,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:10,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:08:10,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:10,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-08 14:08:10,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:10,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:08:10,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:10,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:08:10,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:10,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:10,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-08 14:08:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:10,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:10,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:10,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:08:10,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:10,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:08:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:08:10,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:08:10,886 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-08 14:08:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:12,319 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-08 14:08:12,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:08:12,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-08 14:08:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:12,320 INFO L225 Difference]: With dead ends: 236 [2019-01-08 14:08:12,320 INFO L226 Difference]: Without dead ends: 227 [2019-01-08 14:08:12,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:08:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-08 14:08:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-08 14:08:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-08 14:08:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-08 14:08:13,510 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-08 14:08:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:13,510 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-08 14:08:13,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:08:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-08 14:08:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:13,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:13,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:13,511 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:13,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-08 14:08:13,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:13,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:13,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:13,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:13,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:14,083 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-01-08 14:08:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:14,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:14,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:14,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:14,234 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-08 14:08:14,234 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:14,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:14,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:14,236 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:08:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:14,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:14,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:14,236 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:14,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:14,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:14,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:14,250 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 18 treesize of output 21 [2019-01-08 14:08:14,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,253 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 21 treesize of output 27 [2019-01-08 14:08:14,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,258 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 23 treesize of output 37 [2019-01-08 14:08:14,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,330 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 25 treesize of output 51 [2019-01-08 14:08:14,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,441 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-08 14:08:14,442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:14,442 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:14,577 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:14,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,611 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 36 treesize of output 66 [2019-01-08 14:08:14,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:14,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:14,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:08:14,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:14,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:14,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,769 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:14,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-08 14:08:14,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:14,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:14,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:14,861 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:14,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:08:14,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:14,909 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-08 14:08:14,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:14,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:15,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:15,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:08:15,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:15,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:08:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:08:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:08:15,008 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-08 14:08:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:17,339 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-08 14:08:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:08:17,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:08:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:17,340 INFO L225 Difference]: With dead ends: 326 [2019-01-08 14:08:17,340 INFO L226 Difference]: Without dead ends: 316 [2019-01-08 14:08:17,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:08:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-08 14:08:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-08 14:08:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-08 14:08:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-08 14:08:18,596 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-08 14:08:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:18,596 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-08 14:08:18,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:08:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-08 14:08:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:18,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:18,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:18,597 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-08 14:08:18,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:18,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:18,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:18,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:18,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:18,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:18,709 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-08 14:08:18,710 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:18,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:18,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:18,712 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:08:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:18,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:18,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:18,712 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:18,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:18,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:18,732 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 18 treesize of output 21 [2019-01-08 14:08:18,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:18,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:18,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:18,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:18,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:18,822 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:18,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:08:18,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:18,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:18,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,907 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:18,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-08 14:08:18,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:18,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:08:18,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:18,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:08:18,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:18,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:18,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:08:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:19,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:19,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:19,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:08:19,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:19,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:08:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:08:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:08:19,060 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-08 14:08:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:21,161 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-08 14:08:21,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:08:21,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-08 14:08:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:21,162 INFO L225 Difference]: With dead ends: 288 [2019-01-08 14:08:21,162 INFO L226 Difference]: Without dead ends: 279 [2019-01-08 14:08:21,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:08:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-08 14:08:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-08 14:08:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-08 14:08:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-08 14:08:23,047 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-08 14:08:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:23,047 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-08 14:08:23,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:08:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-08 14:08:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:23,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:23,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:23,048 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-08 14:08:23,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:23,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:23,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:23,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:23,273 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:08:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:08:23,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:23,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:23,314 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:23,315 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-08 14:08:23,315 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:23,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:23,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:23,317 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:08:23,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:23,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:23,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:23,318 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:23,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:23,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:23,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:23,334 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 18 treesize of output 21 [2019-01-08 14:08:23,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:23,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:23,359 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:23,422 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:23,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:08:23,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:23,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:23,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:08:23,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:23,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:08:23,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,573 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:23,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:23,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-08 14:08:23,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:23,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:23,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:08:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:23,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:23,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:23,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:08:23,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:23,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:08:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:08:23,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:08:23,688 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-08 14:08:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:25,819 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-08 14:08:25,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:08:25,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-08 14:08:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:25,821 INFO L225 Difference]: With dead ends: 277 [2019-01-08 14:08:25,821 INFO L226 Difference]: Without dead ends: 268 [2019-01-08 14:08:25,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:08:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-08 14:08:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-08 14:08:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-08 14:08:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-08 14:08:27,782 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-08 14:08:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:27,782 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-08 14:08:27,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:08:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-08 14:08:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:27,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:27,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:27,783 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-08 14:08:27,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:27,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:27,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:27,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:27,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:27,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:27,977 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-08 14:08:27,977 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:27,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:27,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:27,979 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-08 14:08:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:27,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:27,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:27,980 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:27,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:27,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:27,996 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 18 treesize of output 21 [2019-01-08 14:08:27,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:27,998 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 21 treesize of output 27 [2019-01-08 14:08:28,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,003 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 23 treesize of output 37 [2019-01-08 14:08:28,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,009 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 25 treesize of output 51 [2019-01-08 14:08:28,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,016 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:28,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,066 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,093 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:28,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,130 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 36 treesize of output 72 [2019-01-08 14:08:28,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:28,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:28,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,212 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:28,212 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 36 treesize of output 80 [2019-01-08 14:08:28,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:28,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:08:28,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:28,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:28,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:28,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:08:28,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,427 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-08 14:08:28,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:08:28,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:28,469 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:28,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:08:28,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:28,515 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-08 14:08:28,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:08:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:28,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:28,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:28,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-08 14:08:28,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:28,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:08:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:08:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:08:28,633 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-08 14:08:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:31,885 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-08 14:08:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:08:31,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-08 14:08:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:31,887 INFO L225 Difference]: With dead ends: 361 [2019-01-08 14:08:31,887 INFO L226 Difference]: Without dead ends: 356 [2019-01-08 14:08:31,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:08:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-08 14:08:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-08 14:08:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-08 14:08:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-08 14:08:33,935 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-08 14:08:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:33,936 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-08 14:08:33,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:08:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-08 14:08:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:33,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:33,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:33,937 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-08 14:08:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:33,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:33,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:33,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:33,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-08 14:08:34,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:34,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:34,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:08:34,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:08:34,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:34,140 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:08:34,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:08:34,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:08:34,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:08:34,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:34,176 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 18 treesize of output 21 [2019-01-08 14:08:34,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,179 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 21 treesize of output 27 [2019-01-08 14:08:34,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,184 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 23 treesize of output 37 [2019-01-08 14:08:34,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,191 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 25 treesize of output 51 [2019-01-08 14:08:34,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,198 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:34,199 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:34,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:34,314 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 36 treesize of output 72 [2019-01-08 14:08:34,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:34,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:34,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:35,096 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-08 14:08:35,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:35,397 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:35,397 INFO L303 Elim1Store]: Index analysis took 298 ms [2019-01-08 14:08:35,398 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 36 treesize of output 80 [2019-01-08 14:08:35,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:35,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:35,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:36,202 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-08 14:08:36,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:08:36,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:36,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:36,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,402 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:36,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:08:36,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:36,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:36,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:36,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,491 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:36,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:36,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-08 14:08:36,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:36,539 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-08 14:08:36,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:08:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:36,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-08 14:08:36,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:36,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:08:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:08:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:08:36,665 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-08 14:08:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:39,825 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-08 14:08:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:08:39,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-08 14:08:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:39,827 INFO L225 Difference]: With dead ends: 357 [2019-01-08 14:08:39,827 INFO L226 Difference]: Without dead ends: 352 [2019-01-08 14:08:39,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:08:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-08 14:08:41,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-08 14:08:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-08 14:08:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-08 14:08:41,569 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-08 14:08:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:41,570 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-08 14:08:41,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:08:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-08 14:08:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:41,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:41,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:41,571 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-08 14:08:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:41,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:08:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:41,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:41,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:41,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:41,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:08:41,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:08:41,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:41,816 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:41,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:08:41,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:08:41,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:08:41,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:08:41,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:41,849 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 18 treesize of output 21 [2019-01-08 14:08:41,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,851 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 21 treesize of output 27 [2019-01-08 14:08:41,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-08 14:08:41,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,861 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 25 treesize of output 51 [2019-01-08 14:08:41,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:41,869 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:41,869 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:41,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:41,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:41,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:41,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:41,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:41,973 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:42,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,034 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 36 treesize of output 72 [2019-01-08 14:08:42,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:42,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:42,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:42,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:42,113 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 36 treesize of output 80 [2019-01-08 14:08:42,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:42,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:42,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:42,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:08:42,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:42,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:42,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:42,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:42,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:08:42,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:42,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:42,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:42,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:42,379 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:42,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:08:42,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:42,429 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-08 14:08:42,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:42,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:42,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-08 14:08:42,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:42,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:08:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:08:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:08:42,561 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-08 14:08:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:45,071 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-08 14:08:45,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:08:45,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-08 14:08:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:45,073 INFO L225 Difference]: With dead ends: 260 [2019-01-08 14:08:45,073 INFO L226 Difference]: Without dead ends: 253 [2019-01-08 14:08:45,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:08:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-08 14:08:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-08 14:08:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-08 14:08:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-08 14:08:46,270 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-08 14:08:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:46,270 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-08 14:08:46,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:08:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-08 14:08:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:46,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:46,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:46,271 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-08 14:08:46,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:46,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:46,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:08:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:46,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:46,456 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-08 14:08:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:46,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:46,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:46,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:46,540 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-08 14:08:46,541 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:46,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:46,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:46,543 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:08:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:46,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:46,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:46,543 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:46,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:46,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:46,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:46,564 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 18 treesize of output 21 [2019-01-08 14:08:46,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:46,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:46,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:46,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:46,652 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:46,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:08:46,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:46,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:46,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:08:46,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:46,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:46,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,814 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:46,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-08 14:08:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:46,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:08:46,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:46,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:46,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:08:46,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:46,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:46,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:08:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:46,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:47,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:47,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:08:47,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:47,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:08:47,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:08:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:08:47,005 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-08 14:08:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:49,045 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-08 14:08:49,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:08:49,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:08:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:49,047 INFO L225 Difference]: With dead ends: 202 [2019-01-08 14:08:49,047 INFO L226 Difference]: Without dead ends: 195 [2019-01-08 14:08:49,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:08:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-08 14:08:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-08 14:08:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-08 14:08:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-08 14:08:50,530 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-08 14:08:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:50,530 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-08 14:08:50,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:08:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-08 14:08:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:50,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:50,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:50,531 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-08 14:08:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:50,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:50,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:08:50,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:50,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:50,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:50,742 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-08 14:08:50,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:50,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:50,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:50,745 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:08:50,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:50,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:50,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:50,746 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:50,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:50,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:50,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:50,795 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 18 treesize of output 21 [2019-01-08 14:08:50,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:50,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 21 treesize of output 27 [2019-01-08 14:08:50,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:50,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:50,886 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 23 treesize of output 37 [2019-01-08 14:08:50,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:50,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:50,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:50,967 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 25 treesize of output 51 [2019-01-08 14:08:51,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,040 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:51,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,090 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,117 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:51,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,152 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 36 treesize of output 72 [2019-01-08 14:08:51,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:51,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:51,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:08:51,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:51,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:51,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,330 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:51,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:08:51,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:51,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:51,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:51,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:51,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:08:51,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:51,463 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-08 14:08:51,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:08:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:51,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:51,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:51,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:08:51,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:51,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:08:51,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:08:51,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:08:51,564 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-08 14:08:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:53,675 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-08 14:08:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:08:53,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:08:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:53,677 INFO L225 Difference]: With dead ends: 199 [2019-01-08 14:08:53,677 INFO L226 Difference]: Without dead ends: 192 [2019-01-08 14:08:53,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:08:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-08 14:08:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-08 14:08:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-08 14:08:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-08 14:08:54,950 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-08 14:08:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:54,950 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-08 14:08:54,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:08:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-08 14:08:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:54,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:54,951 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:54,951 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:54,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-08 14:08:54,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:54,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:54,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:08:55,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:55,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:55,068 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:55,069 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-08 14:08:55,069 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:55,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:55,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:55,071 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 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-08 14:08:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:55,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:55,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:55,072 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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:55,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:55,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:55,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:55,089 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 18 treesize of output 21 [2019-01-08 14:08:55,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:08:55,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:08:55,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:08:55,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:08:55,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:55,184 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-08 14:08:55,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:08:55,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:55,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:55,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-08 14:08:55,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:55,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:08:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:55,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-08 14:08:55,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:55,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:55,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-08 14:08:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:55,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-08 14:08:55,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:55,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:08:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:08:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:08:55,428 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-08 14:08:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:08:57,262 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-08 14:08:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:08:57,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-08 14:08:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:08:57,263 INFO L225 Difference]: With dead ends: 196 [2019-01-08 14:08:57,263 INFO L226 Difference]: Without dead ends: 187 [2019-01-08 14:08:57,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:08:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-08 14:08:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-08 14:08:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-08 14:08:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-08 14:08:58,806 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-08 14:08:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:08:58,806 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-08 14:08:58,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:08:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-08 14:08:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:08:58,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:08:58,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:08:58,807 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:08:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-08 14:08:58,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:08:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:58,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:08:58,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:08:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:08:58,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:58,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:08:58,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:08:58,918 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-08 14:08:58,918 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:08:58,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:08:58,919 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:08:58,920 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:08:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:08:58,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:08:58,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:08:58,920 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:08:58,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:08:58,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:08:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:08:58,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:08:58,936 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 18 treesize of output 21 [2019-01-08 14:08:58,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,942 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 21 treesize of output 27 [2019-01-08 14:08:58,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,947 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 23 treesize of output 37 [2019-01-08 14:08:58,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,959 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 25 treesize of output 51 [2019-01-08 14:08:58,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:58,965 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:08:58,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:58,993 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:59,045 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:08:59,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,078 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 36 treesize of output 72 [2019-01-08 14:08:59,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:59,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:59,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:08:59,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:08:59,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:08:59,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,234 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:59,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-08 14:08:59,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:59,283 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-08 14:08:59,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-08 14:08:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:59,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:08:59,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:59,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-08 14:08:59,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:59,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:08:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:08:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:08:59,373 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-08 14:08:59,929 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-08 14:09:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:01,868 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-08 14:09:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:01,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-08 14:09:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:01,869 INFO L225 Difference]: With dead ends: 203 [2019-01-08 14:09:01,869 INFO L226 Difference]: Without dead ends: 194 [2019-01-08 14:09:01,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:09:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-08 14:09:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-08 14:09:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-08 14:09:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-08 14:09:03,665 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-08 14:09:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:03,665 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-08 14:09:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-08 14:09:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:09:03,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:03,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:03,666 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-08 14:09:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:03,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:03,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:03,808 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:09:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:03,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:03,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:03,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:09:03,873 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-08 14:09:03,874 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:03,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:03,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:03,876 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:09:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:03,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:03,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:03,876 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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:03,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:03,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:03,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:03,898 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 18 treesize of output 21 [2019-01-08 14:09:03,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,900 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 21 treesize of output 27 [2019-01-08 14:09:03,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,905 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 23 treesize of output 37 [2019-01-08 14:09:03,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,910 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 25 treesize of output 51 [2019-01-08 14:09:03,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:03,917 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:03,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:03,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:03,997 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:04,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,032 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 36 treesize of output 72 [2019-01-08 14:09:04,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:04,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:04,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:09:04,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:04,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:04,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:04,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,197 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:04,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:09:04,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:04,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:04,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:04,281 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:04,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:04,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:04,330 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-08 14:09:04,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:04,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:04,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:04,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:09:04,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:04,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:09:04,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:09:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:09:04,418 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-08 14:09:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:07,261 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-08 14:09:07,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:07,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:09:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:07,263 INFO L225 Difference]: With dead ends: 269 [2019-01-08 14:09:07,263 INFO L226 Difference]: Without dead ends: 265 [2019-01-08 14:09:07,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-08 14:09:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-08 14:09:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-08 14:09:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-08 14:09:09,390 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-08 14:09:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:09,390 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-08 14:09:09,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:09:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-08 14:09:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:09:09,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:09,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:09,391 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-08 14:09:09,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:09,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:09,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:09,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:09,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:09,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:09:09,553 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-08 14:09:09,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:09,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:09,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:09,555 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-08 14:09:09,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:09,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:09,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:09,555 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:09,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:09,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:09,572 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 18 treesize of output 21 [2019-01-08 14:09:09,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,575 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 21 treesize of output 27 [2019-01-08 14:09:09,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,580 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 23 treesize of output 37 [2019-01-08 14:09:09,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,585 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 25 treesize of output 51 [2019-01-08 14:09:09,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,595 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:09,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:09,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:09,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,708 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 36 treesize of output 72 [2019-01-08 14:09:09,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:09,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:09,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:09:09,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:09,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:09,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:09,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:09:09,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:09,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:09,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:09,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:09,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:09,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-08 14:09:09,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,017 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-08 14:09:10,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:10,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:10,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:10,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-08 14:09:10,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:10,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:09:10,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:09:10,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:09:10,107 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-08 14:09:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:12,963 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-08 14:09:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:12,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-08 14:09:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:12,964 INFO L225 Difference]: With dead ends: 253 [2019-01-08 14:09:12,964 INFO L226 Difference]: Without dead ends: 249 [2019-01-08 14:09:12,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-08 14:09:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-08 14:09:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-08 14:09:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-08 14:09:14,964 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-08 14:09:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:14,964 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-08 14:09:14,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:09:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-08 14:09:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:09:14,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:14,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:14,965 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-08 14:09:14,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:14,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:14,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:14,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:09:15,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:15,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:15,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:09:15,063 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-08 14:09:15,063 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:15,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:15,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:15,068 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-08 14:09:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:15,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:15,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:15,069 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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:15,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:15,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:15,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:15,088 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 18 treesize of output 21 [2019-01-08 14:09:15,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,090 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 21 treesize of output 27 [2019-01-08 14:09:15,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,095 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 23 treesize of output 37 [2019-01-08 14:09:15,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,103 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 25 treesize of output 51 [2019-01-08 14:09:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,110 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:15,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:15,188 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:15,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,220 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 36 treesize of output 72 [2019-01-08 14:09:15,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:15,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:15,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:09:15,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:15,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:15,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,376 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:15,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-08 14:09:15,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,420 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-08 14:09:15,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:15,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:15,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:15,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-08 14:09:15,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:15,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:09:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:09:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:09:15,508 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-08 14:09:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:17,917 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-08 14:09:17,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:17,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-08 14:09:17,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:17,918 INFO L225 Difference]: With dead ends: 226 [2019-01-08 14:09:17,919 INFO L226 Difference]: Without dead ends: 217 [2019-01-08 14:09:17,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:09:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-08 14:09:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-08 14:09:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-08 14:09:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-08 14:09:19,923 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-08 14:09:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:19,923 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-08 14:09:19,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-08 14:09:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:09:19,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:19,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:19,924 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-08 14:09:19,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:19,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:20,172 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-08 14:09:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-08 14:09:20,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:20,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:20,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:20,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:20,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:20,279 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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:20,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:20,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:20,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:09:20,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:20,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:20,299 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 18 treesize of output 21 [2019-01-08 14:09:20,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,302 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 21 treesize of output 27 [2019-01-08 14:09:20,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,305 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 23 treesize of output 37 [2019-01-08 14:09:20,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,312 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 25 treesize of output 51 [2019-01-08 14:09:20,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,320 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:20,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:20,399 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:20,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,439 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 36 treesize of output 72 [2019-01-08 14:09:20,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:20,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:20,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:20,514 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 38 treesize of output 79 [2019-01-08 14:09:20,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:20,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:20,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-08 14:09:20,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:20,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:20,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:20,684 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:20,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:20,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:20,731 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-08 14:09:20,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:20,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:09:20,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:20,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:09:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:09:20,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:20,845 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-08 14:09:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:23,757 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-08 14:09:23,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:23,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:09:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:23,758 INFO L225 Difference]: With dead ends: 258 [2019-01-08 14:09:23,758 INFO L226 Difference]: Without dead ends: 251 [2019-01-08 14:09:23,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-08 14:09:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-08 14:09:25,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-08 14:09:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-08 14:09:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-08 14:09:25,736 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-08 14:09:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:25,736 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-08 14:09:25,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:09:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-08 14:09:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:09:25,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:25,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:25,737 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-08 14:09:25,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:25,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:25,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:25,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:25,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:25,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:25,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:25,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:25,904 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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:25,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:25,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:25,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:09:25,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:25,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:25,927 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 18 treesize of output 21 [2019-01-08 14:09:25,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:09:25,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:25,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:09:25,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:25,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:25,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:09:25,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:25,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:25,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:25,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:09:25,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:25,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:25,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:25,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:26,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:26,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:26,017 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-08 14:09:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-08 14:09:26,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:26,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:26,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-08 14:09:26,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,116 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:26,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-08 14:09:26,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:26,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:26,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-08 14:09:26,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-08 14:09:26,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:26,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:26,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-08 14:09:26,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:26,234 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:26,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-08 14:09:26,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:26,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:26,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-08 14:09:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:26,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:26,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:26,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:09:26,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:26,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:09:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:09:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:26,365 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-08 14:09:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:29,453 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-08 14:09:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:29,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:09:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:29,454 INFO L225 Difference]: With dead ends: 279 [2019-01-08 14:09:29,454 INFO L226 Difference]: Without dead ends: 272 [2019-01-08 14:09:29,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:09:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-08 14:09:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-08 14:09:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-08 14:09:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-08 14:09:31,753 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-08 14:09:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:31,753 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-08 14:09:31,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:09:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-08 14:09:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:09:31,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:31,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:31,754 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-08 14:09:31,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:31,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:31,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:31,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:31,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:31,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:31,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:31,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:31,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:31,998 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:32,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:32,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:32,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:09:32,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:32,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:32,016 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 18 treesize of output 21 [2019-01-08 14:09:32,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,019 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 21 treesize of output 27 [2019-01-08 14:09:32,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,023 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 23 treesize of output 37 [2019-01-08 14:09:32,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,029 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 25 treesize of output 51 [2019-01-08 14:09:32,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:32,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,088 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:32,115 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:32,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,154 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 36 treesize of output 72 [2019-01-08 14:09:32,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:32,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:32,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:32,232 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 38 treesize of output 79 [2019-01-08 14:09:32,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:32,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:32,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-08 14:09:32,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:32,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:32,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,403 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:32,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-08 14:09:32,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,451 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-08 14:09:32,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:32,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:32,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:32,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-08 14:09:32,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:32,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:09:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:09:32,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:32,557 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-08 14:09:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:35,706 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-08 14:09:35,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:35,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-08 14:09:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:35,707 INFO L225 Difference]: With dead ends: 256 [2019-01-08 14:09:35,708 INFO L226 Difference]: Without dead ends: 249 [2019-01-08 14:09:35,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:09:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-08 14:09:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-08 14:09:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-08 14:09:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-08 14:09:38,004 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-08 14:09:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:38,004 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-08 14:09:38,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:09:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-08 14:09:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:09:38,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:38,005 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:38,005 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-08 14:09:38,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:38,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:38,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:38,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:38,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:38,218 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-08 14:09:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-08 14:09:38,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:38,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:38,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:38,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:38,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:38,286 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:38,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:38,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:38,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:09:38,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:38,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:38,304 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 18 treesize of output 21 [2019-01-08 14:09:38,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 [2019-01-08 14:09:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-08 14:09:38,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-08 14:09:38,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-08 14:09:38,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:38,398 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-08 14:09:38,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-08 14:09:38,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:38,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-08 14:09:38,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-08 14:09:38,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:38,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-08 14:09:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,540 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:38,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-08 14:09:38,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:38,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-08 14:09:38,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:38,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-01-08 14:09:38,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:38,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:38,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-08 14:09:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:38,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:38,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:38,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-08 14:09:38,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:38,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:09:38,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:09:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:09:38,724 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-08 14:09:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:41,542 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-08 14:09:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:41,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-08 14:09:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:41,543 INFO L225 Difference]: With dead ends: 234 [2019-01-08 14:09:41,544 INFO L226 Difference]: Without dead ends: 207 [2019-01-08 14:09:41,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-08 14:09:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-08 14:09:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:09:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-08 14:09:42,110 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-08 14:09:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:42,110 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-08 14:09:42,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:09:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-08 14:09:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:09:42,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:42,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:42,111 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-08 14:09:42,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:42,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:42,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:42,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:42,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:42,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:42,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-08 14:09:42,345 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-08 14:09:42,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:42,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:42,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:42,347 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 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 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-08 14:09:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:42,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:42,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:42,348 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:42,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:42,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:42,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:42,369 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 18 treesize of output 21 [2019-01-08 14:09:42,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,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 21 treesize of output 27 [2019-01-08 14:09:42,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,377 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 23 treesize of output 37 [2019-01-08 14:09:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,382 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 25 treesize of output 51 [2019-01-08 14:09:42,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,389 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:42,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,467 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,506 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 36 treesize of output 72 [2019-01-08 14:09:42,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:42,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:42,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,585 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:42,586 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 36 treesize of output 80 [2019-01-08 14:09:42,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:42,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:42,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:09:42,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:42,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:42,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,761 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:42,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:09:42,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:42,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:42,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,860 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:42,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:42,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,904 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-08 14:09:42,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:42,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-08 14:09:43,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:43,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:09:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:09:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:09:43,046 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-08 14:09:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:44,488 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-08 14:09:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:09:44,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-08 14:09:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:44,489 INFO L225 Difference]: With dead ends: 76 [2019-01-08 14:09:44,489 INFO L226 Difference]: Without dead ends: 69 [2019-01-08 14:09:44,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-08 14:09:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-08 14:09:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-08 14:09:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-08 14:09:45,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-08 14:09:45,090 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-08 14:09:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:45,090 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-08 14:09:45,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:09:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-08 14:09:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:09:45,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:45,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:45,091 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-08 14:09:45,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:45,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:45,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:45,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:45,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:45,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:45,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:45,308 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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:45,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:45,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:09:45,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:45,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:45,328 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 18 treesize of output 21 [2019-01-08 14:09:45,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,335 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 21 treesize of output 27 [2019-01-08 14:09:45,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,345 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 23 treesize of output 37 [2019-01-08 14:09:45,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,349 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 25 treesize of output 51 [2019-01-08 14:09:45,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:45,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,435 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:45,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,471 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 36 treesize of output 72 [2019-01-08 14:09:45,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:45,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:45,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:09:45,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:45,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:45,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:45,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:09:45,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:45,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:45,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:45,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:45,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:45,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,816 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:45,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:45,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,863 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-08 14:09:45,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:45,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:45,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:45,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-08 14:09:45,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:45,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:09:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:09:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:45,982 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-08 14:09:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:47,389 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-08 14:09:47,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:09:47,390 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-08 14:09:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:47,390 INFO L225 Difference]: With dead ends: 75 [2019-01-08 14:09:47,390 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 14:09:47,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:09:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 14:09:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-08 14:09:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:09:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-08 14:09:47,929 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-08 14:09:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:47,929 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-08 14:09:47,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:09:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-08 14:09:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:09:47,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:47,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:47,930 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-08 14:09:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:47,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:47,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:48,144 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-01-08 14:09:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:48,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:48,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:48,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:48,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:48,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:48,311 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 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:09:48,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:09:48,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:09:48,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:48,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:48,327 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 18 treesize of output 21 [2019-01-08 14:09:48,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,330 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 21 treesize of output 27 [2019-01-08 14:09:48,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,334 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 23 treesize of output 37 [2019-01-08 14:09:48,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,341 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 25 treesize of output 51 [2019-01-08 14:09:48,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,349 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:48,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,435 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:48,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,475 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 36 treesize of output 72 [2019-01-08 14:09:48,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:48,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:48,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-08 14:09:48,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:48,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:48,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,641 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:48,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-08 14:09:48,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:48,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:48,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:48,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:48,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:48,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:48,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,809 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:48,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:48,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,856 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-08 14:09:48,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:48,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:48,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:48,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-08 14:09:48,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:48,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:09:48,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:09:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:48,979 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-08 14:09:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:50,879 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-08 14:09:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:09:50,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-08 14:09:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:50,880 INFO L225 Difference]: With dead ends: 97 [2019-01-08 14:09:50,881 INFO L226 Difference]: Without dead ends: 84 [2019-01-08 14:09:50,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:09:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-08 14:09:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-08 14:09:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-08 14:09:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-08 14:09:51,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-08 14:09:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:51,774 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-08 14:09:51,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:09:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-08 14:09:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:09:51,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:51,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:09:51,775 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-08 14:09:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:51,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:51,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:09:51,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:51,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:51,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:51,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:51,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:51,997 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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:52,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:52,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:52,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:52,014 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 18 treesize of output 21 [2019-01-08 14:09:52,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,016 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 21 treesize of output 27 [2019-01-08 14:09:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,020 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 23 treesize of output 37 [2019-01-08 14:09:52,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,025 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 25 treesize of output 51 [2019-01-08 14:09:52,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,032 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-08 14:09:52,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,058 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,110 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-08 14:09:52,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,145 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 36 treesize of output 72 [2019-01-08 14:09:52,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:52,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:52,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,224 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:52,225 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 38 treesize of output 79 [2019-01-08 14:09:52,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:52,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:52,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-08 14:09:52,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:52,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:52,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:52,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:52,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:52,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:52,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:52,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:52,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-08 14:09:52,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:52,577 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-08 14:09:52,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-08 14:09:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:52,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:52,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:52,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-08 14:09:52,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:52,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:09:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:09:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-08 14:09:52,708 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-08 14:09:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:54,327 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-08 14:09:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:09:54,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-08 14:09:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:54,328 INFO L225 Difference]: With dead ends: 67 [2019-01-08 14:09:54,328 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:09:54,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:09:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:09:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:09:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:09:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:09:54,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-08 14:09:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:54,329 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:09:54,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:09:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:09:54,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:09:54,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:09:54,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:54,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:54,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:54,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:55,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:55,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:55,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:55,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:56,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:57,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:57,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:57,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:58,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:58,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:58,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:09:58,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:02,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:03,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:04,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:09,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:09,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:09,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:10,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:10,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:15,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:16,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:16,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:16,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:16,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:16,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:18,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:28,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:29,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:29,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:29,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:29,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:29,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:34,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:46,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:53,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:54,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:54,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:10:54,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:02,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:02,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:02,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:02,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:02,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:02,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:10,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:10,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:13,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:13,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:13,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:14,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:14,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:14,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:11:20,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:01,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:13,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:14,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:14,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:30,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:30,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:30,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-08 14:12:34,199 WARN L181 SmtUtils]: Spent 2.66 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-08 14:16:31,747 WARN L181 SmtUtils]: Spent 3.96 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-08 14:16:31,751 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:16:31,751 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-08 14:16:31,751 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-08 14:16:31,752 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-08 14:16:31,753 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-08 14:16:31,771 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:16:31 BoogieIcfgContainer [2019-01-08 14:16:31,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:16:31,772 INFO L168 Benchmark]: Toolchain (without parser) took 724621.53 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -311.3 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-01-08 14:16:31,773 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:16:31,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:16:31,773 INFO L168 Benchmark]: Boogie Preprocessor took 36.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:16:31,773 INFO L168 Benchmark]: RCFGBuilder took 427.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:16:31,774 INFO L168 Benchmark]: TraceAbstraction took 724085.77 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -332.4 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-01-08 14:16:31,775 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 427.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 724085.77 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -332.4 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 723.9s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 150.5s AutomataDifference, 0.0s DeadEndRemovalTime, 397.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 61.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 68.3s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 159.8s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 237.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 100.3s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...